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:
Adding a Newline Character to a String in Java
Giới thiệu JDBC Connection Pool
Concatenating Strings In Java
Tránh lỗi NullPointerException trong Java như thế nào?
A Guide to TreeMap in Java
Java Program to Implement Rope
More Jackson Annotations
Extract network card address
Biến trong java
A Guide to Java HashMap
Java Program to Implement LinkedBlockingDeque API
Lớp Collectors trong Java 8
Mockito and JUnit 5 – Using ExtendWith
A Guide to Java SynchronousQueue
Get and Post Lists of Objects with RestTemplate
Java Program to Implement Hash Tables Chaining with List Heads
Working with Network Interfaces in Java
Using Optional with Jackson
Java Program to Check whether Directed Graph is Connected using DFS
A Guide to Java HashMap
SOAP Web service: Upload và Download file sử dụng MTOM trong JAX-WS
Introduction to Thread Pools in Java
Java Program to Implement Shunting Yard Algorithm
Auditing with JPA, Hibernate, and Spring Data JPA
Lớp Properties trong java
OAuth 2.0 Resource Server With Spring Security 5
Case-Insensitive String Matching in Java
Spring REST API + OAuth2 + Angular (using the Spring Security OAuth legacy stack)
Spring Webflux and CORS
Tìm hiểu về Web Service
Generic Constructors in Java
New Features in Java 15