Skip to content

Questions

💡 First try with yourself, if you are unable to solve the question then see the solution.

Lowest Common Ancestor of a Binary Search Tree 
class Solution {
    public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {

        if(root == NULL){
            return NULL;
        }

        if(p ->val < root ->val && q ->val < root ->val){
            return lowestCommonAncestor(root ->left , p , q);
        }
        else if(p ->val > root ->val && q ->val > root ->val){
            return lowestCommonAncestor(root ->right , p , q);
        }
        else{
            return root;
        }
    }
};

🥇 🥇 🥇

Other Important Questions List

Important Questions List

💯 🔥 🚀