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 Dijkstra’s Algorithm using Priority Queue
Java Program to Implement Merge Sort Algorithm on Linked List
Spring Boot - Tomcat Deployment
Encode/Decode to/from Base64
Java Web Services – JAX-WS – SOAP
Java Program to Implement Network Flow Problem
A Guide to Spring Cloud Netflix – Hystrix
Java Program to Perform Partition of an Integer in All Possible Ways
Reading an HTTP Response Body as a String in Java
Java Program to Perform Inorder Recursive Traversal of a Given Binary Tree
Java Program to Implement Circular Doubly Linked List
Java Program to Perform the Unique Factorization of a Given Number
Kiểu dữ liệu Ngày Giờ (Date Time) trong java
Guide to Selenium with JUnit / TestNG
Java Program to Create a Minimal Set of All Edges Whose Addition will Convert it to a Strongly Conne...
Chuyển đổi Array sang ArrayList và ngược lại
Spring Cloud – Adding Angular
Setting the Java Version in Maven
Java Program to implement Circular Buffer
Java Program to Generate Random Numbers Using Multiply with Carry Method
Java Program to Implement Find all Forward Edges in a Graph
Java Program to Implement Bresenham Line Algorithm
Java Program to Implement Hash Tables with Double Hashing
ThreadPoolTaskExecutor corePoolSize vs. maxPoolSize
The Difference Between map() and flatMap()
Testing an OAuth Secured API with Spring MVC
Java Program to Find Nearest Neighbor for Dynamic Data Set
Java Program to Compute the Area of a Triangle Using Determinants
Java Copy Constructor
Spring Webflux with Kotlin
Java Program to Implement Bellman-Ford Algorithm
Java Program to Implement Insertion Sort