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:
File Upload with Spring MVC
Java Program to Generate All Subsets of a Given Set in the Lexico Graphic Order
Guide to Selenium with JUnit / TestNG
Java Program to Perform Right Rotation on a Binary Search Tree
Java Program to Perform integer Partition for a Specific Case
Java Program to Implement Fibonacci Heap
A Quick Guide to Using Keycloak with Spring Boot
Simple Single Sign-On with Spring Security OAuth2
Java Program to Implement Gale Shapley Algorithm
Exploring the Spring Boot TestRestTemplate
Tạo số và chuỗi ngẫu nhiên trong Java
Java Program to Perform the Sorting Using Counting Sort
How to Define a Spring Boot Filter?
Java Program to Find Nearest Neighbor for Static Data Set
Java Program to Implement Interval Tree
Deploy a Spring Boot App to Azure
Spring Boot Actuator
Java Program to Implement Sparse Array
@Lookup Annotation in Spring
Spring Boot - Tomcat Deployment
Simplify the DAO with Spring and Java Generics
ETL with Spring Cloud Data Flow
Hướng dẫn Java Design Pattern – Prototype
Handle EML file with JavaMail
Most commonly used String methods in Java
Java Program to Implement Quick sort
How to Get the Last Element of a Stream in Java?
ExecutorService – Waiting for Threads to Finish
Java Program to Use Above Below Primitive to Test Whether Two Lines Intersect
Câu lệnh điều khiển vòng lặp trong Java (break, continue)
Uploading MultipartFile with Spring RestTemplate
Working with Kotlin and JPA