Lowest Common Ancestor solution

Author: PDKhan

lowest-common-ancestor-of-a-binary-search-tree/PDKhan.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
+        if(root->val < p->val && root->val < q->val)
+            return lowestCommonAncestor(root->right, p, q);
+        else if(root->val > p->val && root->val > q->val)
+            return lowestCommonAncestor(root->left, p, q);
+        else
+            return root;
+    }
+};