This is a java program to construct a binary tree and perform preorder traversal of the constructed binary tree.
Nodes visited are in the order:
visit Root node
visit Left node
visit Right node
Here is the source code of the Java Program to Perform Preorder Recursive Traversal of a Given Binary Tree. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a java program to implement recursive preorder traversal of the Binary Search Tree import java.util.Scanner; class BinarySearchTreeNodes { BinarySearchTreeNodes left, right; int data; public BinarySearchTreeNodes() { left = null; right = null; data = 0; } public BinarySearchTreeNodes(int n) { left = null; right = null; data = n; } public void setLeft(BinarySearchTreeNodes n) { left = n; } public void setRight(BinarySearchTreeNodes n) { right = n; } public BinarySearchTreeNodes getLeft() { return left; } public BinarySearchTreeNodes getRight() { return right; } public void setData(int d) { data = d; } public int getData() { return data; } } class BinarySearchTree { private BinarySearchTreeNodes root; public BinarySearchTree() { root = null; } public boolean isEmpty() { return root == null; } public void insert(int data) { root = insert(root, data); } private BinarySearchTreeNodes insert(BinarySearchTreeNodes node, int data) { if (node == null) node = new BinarySearchTreeNodes(data); else { if (data <= node.getData()) node.left = insert(node.left, data); else node.right = insert(node.right, data); } return node; } public void preorder() { preorder(root); } private void preorder(BinarySearchTreeNodes r) { if (r != null) { System.out.print(r.getData() + " "); preorder(r.getLeft()); preorder(r.getRight()); } } } public class Preorder_Recursive_BST { public static void main(String[] args) { Scanner scan = new Scanner(System.in); BinarySearchTree bst = new BinarySearchTree(); System.out.println("Enter the first 10 elements of the tree\n"); int N = 10; for (int i = 0; i < N; i++) bst.insert(scan.nextInt()); System.out.print("\nPre order : "); bst.preorder(); scan.close(); } }
Output:
$ javac Preorder_Recursive_BST.java $ java Preorder_Recursive_BST Enter the first 10 elements of the tree 12 10 11 03 15 19 02 01 04 70 Pre order : 12 10 3 2 1 4 11 15 19 70
Related posts:
Java Program to Implement Binomial Heap
Guide to the Synchronized Keyword in Java
Toán tử trong java
Intersection of Two Lists in Java
Java Program to Find Second Smallest of n Elements with Given Complexity Constraint
Java Convenience Factory Methods for Collections
Serverless Functions with Spring Cloud Function
Java Program to Check if a Matrix is Invertible
Lớp lồng nhau trong java (Java inner class)
Java Program to Implement ConcurrentLinkedQueue API
Quick Guide to Spring MVC with Velocity
Mảng (Array) trong Java
Hướng dẫn Java Design Pattern – Composite
REST Web service: Tạo ứng dụng Java RESTful Client với Jersey Client 2.x
Introduction to Spring Data REST
Apache Commons Collections SetUtils
Java Program to Implement TreeMap API
Spring Cloud Bus
Java Program to Implement Hamiltonian Cycle Algorithm
Java Program to Implement LinkedTransferQueue API
Comparing Objects in Java
Java Program to Implement vector
Java Program to Implement Sorted Array
Java Program to Implement Bresenham Line Algorithm
How to Return 404 with Spring WebFlux
How to Add a Single Element to a Stream
Hướng dẫn Java Design Pattern – Facade
Java – InputStream to Reader
A Custom Data Binder in Spring MVC
Java Program to Implement Sorting of Less than 100 Numbers in O(n) Complexity
Spring Cloud – Bootstrapping
How to Get All Dates Between Two Dates?