Create main.cpp

Author: JawadSher

18 - Binary Search Tree Data Structure Problems/10 - Lowest Common Ancestor of a Binary Search Tree/main.cpp

@@ -0,0 +1,26 @@
+/**
+ * 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* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
+        if(root == NULL) return NULL;
+
+        if(root -> val < p -> val && root -> val < q -> val) {
+            return lowestCommonAncestor(root -> right, p, q);
+        }
+
+        if(root -> val > p -> val && root -> val > q -> val){
+            return lowestCommonAncestor(root -> left, p, q);
+        }
+
+        return root;
+    }
+};