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 the RSA Algorithm
Java Program to Implement Unrolled Linked List
Handle EML file with JavaMail
Java Program to Generate Randomized Sequence of Given Range of Numbers
Vector trong Java
Java Program to Solve Tower of Hanoi Problem using Stacks
Java Stream Filter with Lambda Expression
SOAP Web service: Authentication trong JAX-WS
Java Program for Topological Sorting in Graphs
Java Program to Implement Tarjan Algorithm
Java Program to Implement Treap
Java Program to Implement Stack API
How to Kill a Java Thread
Concrete Class in Java
Comparing Long Values in Java
Removing all duplicates from a List in Java
Guide to Guava Multimap
Java Program to Solve Travelling Salesman Problem for Unweighted Graph
Guide to DelayQueue
Split a String in Java
Guide to Apache Commons CircularFifoQueue
Java Program to Implement Iterative Deepening
Number Formatting in Java
Extract links from an HTML page
Tránh lỗi ConcurrentModificationException trong Java như thế nào?
Spring WebClient Filters
Lớp Arrarys trong Java (Arrays Utility Class)
Java Program to Generate Random Numbers Using Middle Square Method
A Guide to EnumMap
Transaction Propagation and Isolation in Spring @Transactional
Từ khóa this và super trong Java
Redirect to Different Pages after Login with Spring Security