Create Search in a Binary Search Tree

Author: gs146

Search in a Binary Search Tree

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