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:
Hướng dẫn Java Design Pattern – Transfer Object
Connect through a Proxy
Java Program to Implement DelayQueue API
Check if a String is a Palindrome in Java
Java Program to Implement Sieve Of Atkin
A Guide to JUnit 5
Spring Boot - Tracing Micro Service Logs
Circular Dependencies in Spring
Tính đa hình (Polymorphism) trong Java
Date Time trong Java 8
Introduction to Spring Boot CLI
Java Program to Implement Selection Sort
Java Program to Perform Cryptography Using Transposition Technique
@Lookup Annotation in Spring
Jackson – Change Name of Field
Spring MVC and the @ModelAttribute Annotation
Allow user:password in URL
Java Program to Implement Treap
Java Program to Implement IdentityHashMap API
Guide to Spring 5 WebFlux
Giới thiệu luồng vào ra (I/O) trong Java
Getting Started with Stream Processing with Spring Cloud Data Flow
Java Program to Implement Double Ended Queue
Spring MVC Setup with Kotlin
Java Program to Represent Graph Using 2D Arrays
Java Program to Use the Bellman-Ford Algorithm to Find the Shortest Path
Java Program to Implement the Schonhage-Strassen Algorithm for Multiplication of Two Numbers
Java Program to Check if an UnDirected Graph is a Tree or Not Using DFS
Java Program to Use Boruvka’s Algorithm to Find the Minimum Spanning Tree
Java Program to Implement Find all Back Edges in a Graph
How to Set TLS Version in Apache HttpClient
Hướng dẫn sử dụng lớp Console trong java