This is a java program to search an element using Binary Search Tree. A regular tree traversal algorithm is implemented to search an element. We start from root, if value to be searched is less than root we traverse left, else we check if its greater we traverse right, else it is equal and return true.
Here is the source code of the Java Program to Search for an Element in a Binary Search 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 search an element in binary search tree import java.util.Random; import java.util.Scanner; /* Class BSTNode */ class BSTNode { BSTNode left, right; int data; /* Constructor */ public BSTNode() { left = null; right = null; data = 0; } /* Constructor */ public BSTNode(int n) { left = null; right = null; data = n; } /* Function to set left node */ public void setLeft(BSTNode n) { left = n; } /* Function to set right node */ public void setRight(BSTNode n) { right = n; } /* Function to get left node */ public BSTNode getLeft() { return left; } /* Function to get right node */ public BSTNode getRight() { return right; } /* Function to set data to node */ public void setData(int d) { data = d; } /* Function to get data from node */ public int getData() { return data; } } /* Class BST */ class BST { private BSTNode root; /* Constructor */ public BST() { root = null; } /* Function to check if tree is empty */ public boolean isEmpty() { return root == null; } /* Functions to insert data */ public void insert(int data) { root = insert(root, data); } /* Function to insert data recursively */ 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; } /* Functions to delete data */ public void delete(int k) { if (isEmpty()) System.out.println("Tree Empty"); else if (search(k) == false) System.out.println("Sorry " + k + " is not present"); else { root = delete(root, k); System.out.println(k + " deleted from the tree"); } } private BSTNode delete(BSTNode root, int k) { BSTNode p, p2, n; if (root.getData() == k) { BSTNode lt, rt; lt = root.getLeft(); rt = root.getRight(); if (lt == null && rt == null) return null; else if (lt == null) { p = rt; return p; } else if (rt == null) { p = lt; return p; } else { p2 = rt; p = rt; while (p.getLeft() != null) p = p.getLeft(); p.setLeft(lt); return p2; } } if (k < root.getData()) { n = delete(root.getLeft(), k); root.setLeft(n); } else { n = delete(root.getRight(), k); root.setRight(n); } return root; } /* Functions to count number of nodes */ public int countNodes() { return countNodes(root); } /* Function to count number of nodes recursively */ private int countNodes(BSTNode r) { if (r == null) return 0; else { int l = 1; l += countNodes(r.getLeft()); l += countNodes(r.getRight()); return l; } } /* Functions to search for an element */ public boolean search(int val) { return search(root, val); } /* Function to search for an element recursively */ private boolean search(BSTNode r, int val) { boolean found = false; while ((r != null) && !found) { int rval = r.getData(); if (val < rval) r = r.getLeft(); else if (val > rval) r = r.getRight(); else { found = true; break; } found = search(r, val); } return found; } /* Function for inorder traversal */ public void inorder() { inorder(root); } private void inorder(BSTNode r) { if (r != null) { inorder(r.getLeft()); System.out.print(r.getData() + " "); inorder(r.getRight()); } } /* Function for preorder traversal */ public void preorder() { preorder(root); } private void preorder(BSTNode r) { if (r != null) { System.out.print(r.getData() + " "); preorder(r.getLeft()); preorder(r.getRight()); } } /* Function for postorder traversal */ 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 Search_Element_BST { public static int N = 20; public static void main(String args[]) { Random random = new Random(); BST bst = new BST(); for (int i = 0; i < N; i++) bst.insert(Math.abs(random.nextInt(100))); System.out.print("In order traversal of the tree :\n"); bst.inorder(); System.out.println("\nEnter the element to be searched: "); Scanner sc = new Scanner(System.in); System.out.println("Search result : " + bst.search(sc.nextInt())); sc.close(); } }
Output:
$ javac Search_Element_BST.java $ java Search_Element_BST In order traversal of the tree : 3 4 7 17 18 40 46 48 53 54 59 60 74 77 85 91 92 93 95 96 Enter the element to be searched: 51 Search result : false
Related posts:
StringBuilder vs StringBuffer in Java
Converting String to Stream of chars
Quick Guide to @RestClientTest in Spring Boot
Java Program to Implement Splay Tree
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
Hướng dẫn Java Design Pattern – Singleton
Spring Security with Maven
Java Program to Implement Shell Sort
Automatic Property Expansion with Spring Boot
Introduction to Spring Cloud CLI
Generating Random Numbers in a Range in Java
Java Program to Find Path Between Two Nodes in a Graph
An Introduction to ThreadLocal in Java
Spring Boot Actuator
Giới thiệu luồng vào ra (I/O) trong Java
Java Program to Check Cycle in a Graph using Graph traversal
Java Program to Generate All Possible Subsets with Exactly k Elements in Each Subset
Giới thiệu java.io.tmpdir
Java Program to Perform Addition Operation Using Bitwise Operators
Hướng dẫn Java Design Pattern – Command
Java Program to Find Basis and Dimension of a Matrix
Working With Maps Using Streams
Running Spring Boot Applications With Minikube
Java Program to Check Cycle in a Graph using Topological Sort
Remove the First Element from a List
Java String to InputStream
Apache Commons Collections BidiMap
Java Program to Implement Park-Miller Random Number Generation Algorithm
Period and Duration in Java
Java Program to Solve Tower of Hanoi Problem using Stacks
Filtering and Transforming Collections in Guava
Anonymous Classes in Java