leetcode hot 02

合集 - leetcode hot100(25)

1.leetcode hot 0102-15

2.leetcode hot 0202-15

3.leetcode hot 0402-164.leetcode hot 0302-155.leetcode hot 0502-176.leetcode hot 0602-197.leetcode hot 0702-208.leetcode hot 0802-219.leetcode hot 0902-2110.leetcode hot 1002-2411.leetcode hot 1202-2512.leetcode hot 1302-2613.leetcode hot 1402-2814.leetcode hot 1503-0115.leetcode hot 1103-0316.leetcode hot 1603-0317.leetcode hot 1703-0318.leetcode hot 1803-0319.leetcode hot 1903-0420.leetcode hot 2003-0521.leetcode hot 2103-0522.leetcode hot 2203-1223.leetcode hot 2303-1224.leetcode hot 2403-1225.leetcode hot 2503-12

收起

解题思路：找祖先从底向上递归后序遍历查找，遇到p，q或者空节点就直接返回对应值，当某个节点的左子树、右子树都返回了值，那么就说明该节点就是最近祖先节点，然后把该节点的值继续往上传，直到根节点返回结果。

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