对称二叉树

package daily20210105;

/**
 * @author : zhaoliang
 * @program :newCoder
 * @description : 对称二叉树
 * @create : 2021/01/05 20:24
 */
public class isSymmetric {
    //给定一个二叉树，检查它是否是镜像对称的。
    class TreeNode{
        TreeNode left;
        TreeNode right;
        int val;
        TreeNode(int x,TreeNode left,TreeNode right){
            this.val = x;
            this.left = left;
            this.right = right;
        }
    }
    public boolean isSymmetric(TreeNode root){
        if (root==null)return true;
        return helper(root,root);
    }

    private boolean helper(TreeNode left, TreeNode right) {
        if (left==null && right==null)return true;
        if (left==null || right==null)return false;
        if (left.val!=right.val)return false;
        return helper(left.left,right.right) && helper(left.right,right.left);
    }
}