Create Search in BST

Author: akshayavb99

Course 2 - Data Structures in JAVA/Lecture 13 - BST I/Search in BST

@@ -0,0 +1,60 @@
+/*
+Given a BST and an integer k. Find if the integer k is present in given BST or not. You have to return true, if node with data k is present, return false otherwise.
+Note: Assume that BST contains all unique elements.
+
+Input Format:
+The first line of input contains data of the nodes of the tree in level order form. The data of the nodes of the tree is separated by space. If any node does not have left or right child, take -1 in its place. Since -1 is used as an indication whether the left or right nodes exist, therefore, it will not be a part of the data of any node.   
+The following line of input contains an integer, that denotes the value of k.
+
+Output Format:
+The first and only line of output contains a boolean value. Print true, if node with data k is present, print false otherwise. 
+
+Constraints:
+Time Limit: 1 second
+
+Sample Input 1 :
+8 5 10 2 6 -1 -1 -1 -1 -1 7 -1 -1
+2
+Sample Output 1 :
+true
+S
+ample Input 2 :
+8 5 10 2 6 -1 -1 -1 -1 -1 7 -1 -1
+12
+Sample Output 2 :
+false
+*/
+public class Solution {
+
+	/*
+	 * Binary Tree Node class
+	 * 
+	 * class BinaryTreeNode<T> { T data; BinaryTreeNode<T> left; BinaryTreeNode<T> right;
+	 * 
+	 * public BinaryTreeNode(T data) { this.data = data; } }
+	 */
+
+
+	public static boolean searchInBST(BinaryTreeNode<Integer> root, int k) {
+        if (root==null)
+        {
+            return false;
+        }
+        
+        int rootData=root.data;
+        if (k<rootData)
+        {
+            return searchInBST(root.left,k);
+        }
+        else if(k>rootData)
+        {
+            return searchInBST(root.right,k);
+        }
+        else
+        {
+            return true;
+        }
+        
+		
+	}
+}