LCA 问题

（1）：
带有parent指针
Lowest Common Ancestor II
description：
Given the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes.

The lowest common ancestor is the node with largest depth which is the ancestor of both nodes.

The node has an extra attribute parent which point to the father of itself. The root’s parent is null.

Have you met this question in a real interview? Yes
Example
For the following binary tree:

4
/ \
3 7
/ \
5 6
LCA(3, 5) = 4

LCA(5, 6) = 7

LCA(6, 7) = 7

/**
 * Definition of ParentTreeNode:
 * 
 * class ParentTreeNode {
 *     public ParentTreeNode parent, left, right;
 * }
 */
public class Solution {
    /**
     * @param root: The root of the tree
     * @param A, B: Two node in the tree
     * @return: The lowest common ancestor of A and B
     */
    public ParentTreeNode lowestCommonAncestorII(ParentTreeNode root,
                                                 ParentTreeNode A,
                                                 ParentTreeNode B) {
        // Write your code here   
        ArrayList<ParentTreeNode> first = util(A);
        ArrayList<ParentTreeNode> secend = util(B);
        int sizeA = first.size() - 1;
        int sizeB = secend.size() - 1;
        ParentTreeNode node = null;
        while(sizeA >= 0 && sizeB >= 0) {
            if (first.get(sizeA) != secend.get(sizeB)) {
                break;
            }
            node = first.get(sizeA);
            sizeA--;
            sizeB--;
        }
        return node;
    }
    private ArrayList<ParentTreeNode> util(ParentTreeNode node) {
        ArrayList<ParentTreeNode> list = new ArrayList<>();
        while (node != null) {
            list.add(node);
            node = node.parent;
        }
        return list;
    }
}

（2）不带有parent指针的node节点
description:
Given the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes.

The lowest common ancestor is the node with largest depth which is the ancestor of both nodes.

Notice

Assume two nodes are exist in tree.

Have you met this question in a real interview? Yes
Example
For the following binary tree:

4
/ \
3 7
/ \
5 6
LCA(3, 5) = 4

LCA(5, 6) = 7

LCA(6, 7) = 7

解题方法：
因为题目中说，所有的点是一定存在的，因此找到所有点==> root
找到left ==> left, 找到right ==> right

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of the binary search tree.
     * @param A and B: two nodes in a Binary.
     * @return: Return the least common ancestor(LCA) of the two nodes.
     */
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode A, TreeNode B) {
        // write your code here
        if (root == null || root == A || root == B) {
            return root;
        }
        TreeNode left = lowestCommonAncestor(root.left, A, B);
        TreeNode right = lowestCommonAncestor(root.right, A, B);
        if (left != null && right != null) {
            return root;
        }
        if (left != null && right == null) {
            return left;
        }
        if (right != null && left == null) {
            return right;
        }
        return null;
    }
}