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:
Serve Static Resources with Spring
A Quick Guide to Spring MVC Matrix Variables
Java Program to Implement Gabow Algorithm
Spring REST with a Zuul Proxy
So sánh ArrayList và Vector trong Java
Basic Authentication with the RestTemplate
Batch Processing with Spring Cloud Data Flow
Java Program to Implement Sorted Doubly Linked List
Phương thức tham chiếu trong Java 8 – Method References
Send an email using the SMTP protocol
4 tính chất của lập trình hướng đối tượng trong Java
CharSequence vs. String in Java
Request a Delivery / Read Receipt in Javamail
Custom HTTP Header with the HttpClient
Convert Hex to ASCII in Java
Lập trình hướng đối tượng (OOPs) trong java
Zipping Collections in Java
Java Program to Find SSSP (Single Source Shortest Path) in DAG (Directed Acyclic Graphs)
Java Program to Check Whether an Undirected Graph Contains a Eulerian Cycle
Java Program to Represent Graph Using Linked List
Java Program to Implement Shell Sort
Hướng dẫn Java Design Pattern – DAO
Bootstrapping Hibernate 5 with Spring
Hướng dẫn sử dụng luồng vào ra ký tự trong Java
Tạo chương trình Java đầu tiên sử dụng Eclipse
Java Program to Implement Heap
Java Program to Implement Miller Rabin Primality Test Algorithm
Java Program to Implement ConcurrentHashMap API
Using the Map.Entry Java Class
Java Program to Implement Gift Wrapping Algorithm in Two Dimensions
Xây dựng ứng dụng Client-Server với Socket trong Java
Compact Strings in Java 9