LeetCode力扣101.对称二叉树 Java

递归：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isSymmetric(TreeNode root){
        if(root==null){
            return false;
        }
        return digui(root.left,root.right);
    }
    
    public boolean digui(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 digui(left.left,right.right) && digui(left.right,right.left);
    }
    
}