Share my easy cpp solution


  • 0
    Z
    class Solution {
    public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {  
    	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);
    	return root;
    }
    };

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.