二叉树两个节点最近祖先

 * 寻找两个节点最近的祖先
 *
 * @param node1
 * @param node2
 * @return
 */
public static TreeNode searchNearestAncester(TreeNode node1, TreeNode node2) {
    List list = new ArrayList();
    list.add(node1);
    if (node1.parent != null) {
        while (node1.parent != null) {
            list.add(node1.parent);
            node1 = node1.parent;
        }
    }
    //
    if (list.indexOf(node2) != -1)
        return node2;
    if (node2!= null) {
        while (node2.parent!= null) {
            node2 = node2.parent;
            if (list.indexOf(node2) != -1)
                return node2;
        }
    }
    return null;
}