This is a java program to construct a binary tree and perform inorder traversal of the constructed binary tree.
Nodes visited are in the order:
visit Left node
visit Root node
visit Right node
Here is the source code of the Java Program to Perform Inorder 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 inorder 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 inorder() { inorder(root); } private void inorder(BinarySearchTreeNodes r) { if (r != null) { inorder(r.getLeft()); System.out.print(r.getData() + " "); inorder(r.getRight()); } } } public class Inorder_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("\nIn order : "); bst.inorder(); scan.close(); } }
Output:
$ javac Inorder_Recursive_BST.java $ java Inorder_Recursive_BST Enter the first 10 elements of the tree 12 10 11 03 15 19 02 01 04 70 In order : 1 2 3 4 10 11 12 15 19 70
Related posts:
Java toString() Method
Spring Data MongoDB – Indexes, Annotations and Converters
Map to String Conversion in Java
Java Program to Search Number Using Divide and Conquer with the Aid of Fibonacci Numbers
Compact Strings in Java 9
Java Program to Implement Jarvis Algorithm
Spring Boot - Servlet Filter
A Guide to LinkedHashMap in Java
Java Program to Implement Rope
Java InputStream to String
Compare Two JSON Objects with Jackson
So sánh ArrayList và LinkedList trong Java
Java Program to Implement Radix Sort
Hướng dẫn Java Design Pattern – Factory Method
How to Replace Many if Statements in Java
REST Web service: HTTP Status Code và xử lý ngoại lệ RESTful web service với Jersey 2.x
Biến trong java
How to Set TLS Version in Apache HttpClient
Configuring a DataSource Programmatically in Spring Boot
Custom Thread Pools In Java 8 Parallel Streams
Creating a Custom Starter with Spring Boot
Java Program to Optimize Wire Length in Electrical Circuit
Hướng dẫn Java Design Pattern – Memento
HttpClient 4 – Send Custom Cookie
Iterable to Stream in Java
JUnit5 @RunWith
Java – Write a Reader to File
Lớp LinkedHashMap trong Java
New Features in Java 11
Java Program to Solve Knapsack Problem Using Dynamic Programming
Java Program to Find a Good Feedback Vertex Set
An Example of Load Balancing with Zuul and Eureka