LeetCode——关于二叉树最近公共祖先的问题

235. 二叉搜索树的最近公共祖先

首先当树为二叉搜索树时，情况较为简单，直接递归遍历即可

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
     
     TreeNode res = null;
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        
        lca(root, p , q);
        return res;
    }
    
    public void lca(TreeNode root, TreeNode p , TreeNode q){
        if((root.val - p.val)*(root.val - q.val) <= 0){
            res = root;
        }else if(root.val < p.val && root.val < q.val){
            lca(root.right, p , q);
        }else{
            lca(root.left, p , q);
        }
    }
}

这种方法效率比直接递归和迭代的效率高多了

如果情况换成二叉树将会很复杂，因为二叉树结点的值没有顺序性

236. 二叉树的最近公共祖先

这种情况下只能分别遍历左右子树寻找公共祖先

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root == null||p == root||q == root)
            return root;
        TreeNode left = lowestCommonAncestor(root.left,p,q);
        TreeNode right = lowestCommonAncestor(root.right,p,q);
        if(left != null&&right != null)
            return root;
        else if(left == null&&right == null)
            return null;
        else if(left == null)
            return right;
        else 
            return left;
    }
}