二叉树的公共祖先

leetcode 236

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {

    private TreeNode ans;


    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        ans = null;
        deep(root, p, q);
        return ans;        
    }

    private int deep(TreeNode root, TreeNode p, TreeNode q) {
        if (root == null) {
            return 0;
        }
        int r = 0;
        if (root.val == p.val) {
            r = 1;
        } else if (root.val == q.val) {
            r = 2;
        }
        int left = deep(root.left, p, q);
        int right = deep(root.right, p, q);
        r = r | left | right;
        if (r == 3 && ans == null) {
            ans = root;
        }
        return r;
    }

}