日常刷题-二叉树的最近公共祖先

package com.daily.daily20210123;

/**
 * @Project: dailyCode
 * @Site: http://www.zhao1iang.club/
 * @Copyright: ©CodeLamp
 * @Author: zhaoliang
 * @Create: 2021-01-23 19:27
 * @Desc： 二叉树的最近公共祖先
 **/
public class lowestCommonAncestor {
    class TreeNode{
        int val;
        TreeNode left;
        TreeNode right;
        TreeNode(int x){
            this.val = x;
        }
    }
    public TreeNode lowestCommonAncestor(TreeNode root,TreeNode p,TreeNode q){
      return helper(root,p,q);
    }

    private TreeNode helper(TreeNode root, TreeNode p, TreeNode q) {
        if (root==null || root==p || root==q)return root;
        TreeNode left = helper(root.left,p,q);
        TreeNode right = helper(root.right,p,q);
        if (left==null && right==null)return null;
        if (left==null)return right;
        if (right==null)return left;
        return root;
    }

}