【剑指 Offer 68 - II. 二叉树的最近公共祖先】（同上一题一样）

 

【解题思路】

思路和代码和上一题相同。

 

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    TreeNode to1, to2;
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        TreeNode ans = root, c = root;
        to1 = p; to2 = q;
        while(c != null)
        {
            if((c==p || c==q) && find(c.left))
            {
                ans = c;
                break;
            }
            else if((c==p || c==q) && find(c.right))
            {
                ans = c;
                break;
            }
            else if(find(c.left) && find(c.right) )
            {
                ans = c;
                break;
            }
            else if(find(c.left))
            {
                c = c.left;
            }
            else{
                c = c.right;
            }
        }
 
        return ans;
    }
 
    public boolean find(TreeNode c)
    {
        if(c == null) return false;
        else if(c == to1 || c == to2) return true;
        return find(c.left) || find(c.right);
    }
}