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 Heap’s Algorithm for Permutation of N Numbers
Hướng dẫn Java Design Pattern – Adapter
An Intro to Spring Cloud Contract
Integer Constant Pool trong Java
Concurrent Test Execution in Spring 5
Java Program to Perform Naive String Matching
Java Program to Implement D-ary-Heap
Vòng lặp for, while, do-while trong Java
The Difference Between Collection.stream().forEach() and Collection.forEach()
Removing all Nulls from a List in Java
The SpringJUnitConfig and SpringJUnitWebConfig Annotations in Spring 5
Hướng dẫn Java Design Pattern – Template Method
Validate email address exists or not by Java Code
Java Program to Implement First Fit Decreasing for 1-D Objects and M Bins
Server-Sent Events in Spring
A Guide To UDP In Java
Tạo ứng dụng Java RESTful Client với thư viện Retrofit
Java Program to Implement Bloom Filter
Working with Network Interfaces in Java
Introduction to Liquibase Rollback
Java Program to implement Dynamic Array
Convert Hex to ASCII in Java
How to Get All Dates Between Two Dates?
Hướng dẫn sử dụng luồng vào ra nhị phân trong Java
Collect a Java Stream to an Immutable Collection
SOAP Web service: Upload và Download file sử dụng MTOM trong JAX-WS
The Order of Tests in JUnit
Java Program to Check whether Graph is a Bipartite using DFS
Updating your Password
Java Program to Find the Edge Connectivity of a Graph
Java Program to Implement Miller Rabin Primality Test Algorithm
Java Program to Implement WeakHashMap API