LintCode 最近公共祖先题目代码

/**
 * 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 node1, TreeNode node2) {
        // write your code here
        if (root == null || root == node1 || root == node2) {
            return root;
        }
        
        TreeNode left = lowestCommonAncestor(root.left, node1, node2);
        TreeNode right =  lowestCommonAncestor(root.right, node1, node2);
        
        if(left != null && right != null) {
            return root;
        }
        else if(left!= null)
            return left;
        else if(right != null)
            return right;
        
        return null;
    }
}