Create 700 - cpp/py

Author: ashwek

solution/0700.Search in a Binary Search Tree/Solution.cpp

@@ -0,0 +1,30 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Solution {
+ public:
+    TreeNode* searchBST(TreeNode* root, int val) {
+
+        TreeNode* temp = root;
+
+        while( temp != NULL ){
+            if( temp->val == val ){
+                return temp;
+            }
+            else if( val < temp->val ){
+                temp = temp->left;
+            }
+            else{
+                temp = temp->right;
+            }
+        }
+
+        return NULL;
+    }
+};

solution/0700.Search in a Binary Search Tree/Solution.py

@@ -0,0 +1,27 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution:
+    def searchBST(self, root, val):
+        """
+        :type root: TreeNode
+        :type val: int
+        :rtype: TreeNode
+        """
+
+        temp = root
+
+        while temp != None :
+
+            if temp.val == val :
+                return temp
+            elif val < temp.val :
+                temp = temp.left
+            else:
+                temp = temp.right
+
+        return None