Create Is node present

Author: akshayavb99

Course 2 - Data Structures in JAVA/Lecture 11 - Binary Trees I/Is node present

@@ -0,0 +1,66 @@
+/*
+For a given Binary Tree of type integer and a number X, find whether a node exists in the tree with data X or not.
+
+Input Format:
+The first and the only line of input will contain the node data, all separated by a single space. 
+Since -1 is used as an indication whether the left or right node data exist for root, it will not be a part of the node data.
+
+Output Format:
+The only line of output prints 'true' or 'false'.
+Note: You are not required to print anything explicitly. It has already been taken care of.
+
+Constraints:
+1 <= N <= 10^5
+Where N is the total number of nodes in the binary tree.
+Time Limit: 1 sec
+
+Sample Input 1:
+8 3 10 1 6 -1 14 -1 -1 4 7 13 -1 -1 -1 -1 -1 -1 -1
+7
+Sample Output 1:
+true
+
+Sample Input 2:
+2 3 4 -1 -1 -1 -1
+10
+Sample Output 2:
+false
+*/
+/*
+	
+	Following is the structure used to represent the Binary Tree Node
+
+	class BinaryTreeNode<T> {
+		T data;
+		BinaryTreeNode<T> left;
+		BinaryTreeNode<T> right;
+
+		public BinaryTreeNode(T data) {
+			this.data = data;
+			this.left = null;
+			this.right = null;
+		}
+	}
+
+*/
+
+public class Solution {
+
+	public static boolean isNodePresent(BinaryTreeNode<Integer> root, int x) {
+	    //Your code goes here
+        if (root==null)
+        {
+            return false;
+        }
+        
+        if (root.data==x)
+        {
+            return true;
+        }
+        else
+        {
+            return (isNodePresent(root.left,x)||isNodePresent(root.right,x));
+        }
+	}
+
+}