Lowest Common Ancestor of a Binary Search Tree.cpp

#include<iostream>

using namespace std;

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 || !p || !q) return root;
        if(root->val == p->val || root->val==q->val) return root;
        if(p->val > root->val && q->val < root->val || p->val < root->val && q->val > root->val ) return root;
        if(p->val < root->val && q->val < root->val) return lowestCommonAncestor(root->left,p,q);
        if(p->val > root->val && q->val > root->val) return lowestCommonAncestor(root->right,p,q);
    }
};

int main(){

}