Merge remote-tracking branch 'upstream/main' into Design-Pattern-Contd

Author: ShanukaPrabodha

Basics/Data Structure/binaryTree/BinarySearchTree.java

@@ -0,0 +1,86 @@
+package binaryTree;
+
+public class BinarySearchTree {
+
+private TreeNode root;
+
+private class TreeNode {
+private int data;
+private TreeNode left;
+private TreeNode right;
+
+public TreeNode(int data) {
+this.data = data;
+}
+}
+
+public void insert(int value) {
+root = insert(root, value);
+}
+
+public TreeNode insert(TreeNode root, int value) {
+if(root == null) {
+root = new TreeNode(value);
+return root;
+}
+
+if(value < root.data) {
+root.left = insert(root.left, value);
+} else {
+root.right = insert(root.right, value);
+}
+return root;
+}
+
+public void inOrder() {
+inOrder(root);
+}
+
+public void inOrder(TreeNode root) {
+if(root == null) {
+return;
+}
+inOrder(root.left);
+System.out.print(root.data + " ");
+inOrder(root.right);
+}
+
+public TreeNode search(int key) {
+return search(root, key);
+}
+
+public TreeNode search(TreeNode root, int key) {
+if(root == null || root.data == key) { // base case 
+return root;
+}
+
+if(key < root.data) {
+return search(root.left, key);
+} else {
+return search(root.right, key);
+}
+
+}
+
+public static void main(String[] args) {
+
+BinarySearchTree tree = new BinarySearchTree();
+tree.insert(10);
+tree.insert(8);
+tree.insert(4);
+tree.insert(1);
+
+tree.inOrder();
+
+System.out.println();
+
+if(null != tree.search(10)) {
+System.out.println("Key found !!!");
+} else {
+System.out.println("Key not found !!!");
+}
+}
+
+}
+
+