【leetcode】二叉树的LCA问题：Lowest Common Ancestor of a Binary Tree

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the lowest node in T that has both v and w as descendants (where we allow a node to be a descendant of itself).”

        _______3______
       /              \
    ___5__          ___1__
   /      \        /      \
   6      _2       0       8
         /  \
         7   4

For example, the lowest common ancestor (LCA) of nodes 5 and 1 is 3. Another example is LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.

寻找二叉树的最小共同祖先（LCA），最终还是递归问题，定义left和right递归调用原函数，直到叶子结点为止。

判断两个输入参数的父节点，有三种情况：

第一，分别为左右树，父节点为root (第一个if条件)

第二，遍历到P和Q时，将其返回给left和right,(第二个if条件)

第三，根据left和right的值进行判断，父节点是左边还是右边并返回对应值（第三个if条件）。

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

    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
       if(root==null) return null;
        TreeNode left=lowestCommonAncestor(root.left,p,q);
        TreeNode right=lowestCommonAncestor(root.right,p,q);
        if(left==null&&right==null){
            return root;
        }else if(root==p||root==q){
            return root;
        }else return left!=null?left:right;
           
           
           
       
    }
}