class Solution {
    public TreeNode lowestCommonAncestor(TreeNode t, TreeNode p, TreeNode q) {
        if(t.val<p.val&&t.val<q.val)return lowestCommonAncestor(t.right,p,q);
        if(p.val<t.val&&q.val<t.val)return lowestCommonAncestor(t.left,p,q);
        return t;
    }
}
 

---

相關推薦