This is a Java Program to perform insertion in the binary search tree.
Here is the source code of the Java Program to Perform Insertion in a BST. 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 insert elements in a Binary Search Tree import java.util.Scanner; class BSTNode { BSTNode left, right; int data; public BSTNode() { left = null; right = null; data = 0; } public BSTNode(int n) { left = null; right = null; data = n; } public void setLeft(BSTNode n) { left = n; } public void setRight(BSTNode n) { right = n; } public BSTNode getLeft() { return left; } public BSTNode getRight() { return right; } public void setData(int d) { data = d; } public int getData() { return data; } } class BSTree { private BSTNode root; public BSTree() { root = null; } public boolean isEmpty() { return root == null; } public void insert(int data) { root = insert(root, data); } private BSTNode insert(BSTNode node, int data) { if (node == null) node = new BSTNode(data); else { if (data <= node.getData()) node.left = insert(node.left, data); else node.right = insert(node.right, data); } return node; } public void inorder() { inorder(root); } private void inorder(BSTNode r) { if (r != null) { inorder(r.getLeft()); System.out.print(r.getData() + " "); inorder(r.getRight()); } } public void preorder() { preorder(root); } private void preorder(BSTNode r) { if (r != null) { System.out.print(r.getData() + " "); preorder(r.getLeft()); preorder(r.getRight()); } } public void postorder() { postorder(root); } private void postorder(BSTNode r) { if (r != null) { postorder(r.getLeft()); postorder(r.getRight()); System.out.print(r.getData() + " "); } } } public class Insertion_BST { public static void main(String[] args) { Scanner scan = new Scanner(System.in); BSTree bst = new BSTree(); System.out.println("Binary Search Tree Insertion Test\n"); int N = 10; for (int i = 0; i < N; i++) { bst.insert(scan.nextInt()); System.out.print("\nPost order : "); bst.postorder(); System.out.print("\nPre order : "); bst.preorder(); System.out.print("\nIn order : "); bst.inorder(); } scan.close(); } }
Output:
$ java Insertion_BST.java $ java Insertion_BST Binary Search Tree Insertion Test Add element: 3 Post order : 3 Pre order : 3 In order : 3 Add element: 5 Post order : 5 3 Pre order : 3 5 In order : 3 5 Add element: 4 Post order : 4 5 3 Pre order : 3 5 4 In order : 3 4 5 Add element: 4 Post order : 4 4 5 3 Pre order : 3 5 4 4 In order : 3 4 4 5 Add element: 6 Post order : 4 4 6 5 3 Pre order : 3 5 4 4 6 In order : 3 4 4 5 6 Add element: 45 Post order : 4 4 45 6 5 3 Pre order : 3 5 4 4 6 45 In order : 3 4 4 5 6 45 Add element: 7578 Post order : 4 4 7578 45 6 5 3 Pre order : 3 5 4 4 6 45 7578 In order : 3 4 4 5 6 45 7578 Add element: 54651 Post order : 4 4 54651 7578 45 6 5 3 Pre order : 3 5 4 4 6 45 7578 54651 In order : 3 4 4 5 6 45 7578 54651 Add element: 22 Post order : 4 4 22 54651 7578 45 6 5 3 Pre order : 3 5 4 4 6 45 22 7578 54651 In order : 3 4 4 5 6 22 45 7578 54651 Add element: 34 Post order : 4 4 34 22 54651 7578 45 6 5 3 Pre order : 3 5 4 4 6 45 22 34 7578 54651 In order : 3 4 4 5 6 22 34 45 7578 54651
Related posts:
Hướng dẫn sử dụng String Format trong Java
Java Program to Implement Sorted Singly Linked List
Spring Boot - Tomcat Deployment
Java Program to Implement the Hungarian Algorithm for Bipartite Matching
Java Program to Implement CopyOnWriteArrayList API
Java Program to Create a Balanced Binary Tree of the Incoming Data
Hamcrest Collections Cookbook
HttpClient Connection Management
A Guide to System.exit()
Java Program to Perform Searching in a 2-Dimension K-D Tree
Tính kế thừa (Inheritance) trong java
Java Program to Find Inverse of a Matrix
Create a Custom Auto-Configuration with Spring Boot
Java Program to Evaluate an Expression using Stacks
Java Program to Implement Interval Tree
Mapping Nested Values with Jackson
Java Map With Case-Insensitive Keys
Java Program to Check Whether it is Weakly Connected or Strongly Connected for a Directed Graph
Mảng (Array) trong Java
Java Program to Solve Travelling Salesman Problem for Unweighted Graph
Collect a Java Stream to an Immutable Collection
Java Program to Find a Good Feedback Edge Set in a Graph
Converting a List to String in Java
Java Program to Find the GCD and LCM of two Numbers
Java Program to Decode a Message Encoded Using Playfair Cipher
Anonymous Classes in Java
A Guide to LinkedHashMap in Java
Spring WebClient and OAuth2 Support
Kết hợp Java Reflection và Java Annotations
Apache Camel with Spring Boot
A Guide to JPA with Spring
Java Program to Find Shortest Path Between All Vertices Using Floyd-Warshall’s Algorithm