数据结构每日学习 Day10 二叉树的最近公共祖先

递归一个套路 后续遍历 最后返回结果给根节点 所以都是从根节点开始遍历

ac：

/**
 * 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==null||root==p||root==q){
            return root;
        }

        TreeNode left=lowestCommonAncestor(root.left,p,q);
        TreeNode right=lowestCommonAncestor(root.right, p, q);

        if(left==null){
            return right;
        }
        if(right==null){
            return left;
        }
        return root;





    }
}