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:
Check if there is mail waiting
Spring Boot - Database Handling
Java Program to Implement Graph Coloring Algorithm
Mảng (Array) trong Java
The “final” Keyword in Java
Map Interface trong java
Creating a Custom Starter with Spring Boot
Java – String to Reader
Filtering and Transforming Collections in Guava
Template Engines for Spring
A Guide to Java HashMap
Tránh lỗi NullPointerException trong Java như thế nào?
Number Formatting in Java
Getting a File’s Mime Type in Java
Java Program to Implement Control Table
Java Program to Generate Randomized Sequence of Given Range of Numbers
Add Multiple Items to an Java ArrayList
Adding Parameters to HttpClient Requests
Java Program to Compute Cross Product of Two Vectors
Java Program to Implement Sieve Of Atkin
Hướng dẫn sử dụng luồng vào ra nhị phân trong Java
Java Program to Implement Singly Linked List
Hướng dẫn Java Design Pattern – Template Method
Iterating over Enum Values in Java
Introduction to Thread Pools in Java
Java Program to Perform Insertion in a BST
Introduction to Using FreeMarker in Spring MVC
Java Program to Implement Hash Tables
Java Program to Print the Kind of Rotation the AVL Tree is Undergoing
Java Program to Implement Caesar Cypher
Testing an OAuth Secured API with Spring MVC
Working with Kotlin and JPA