二叉树的最近公共祖先

二叉树的最近公共祖先

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

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