力扣101对称二叉树

无论是递归法还是迭代法，实质就是判断根节点的左孩子结点与右孩子结点是不是同时为空或者它们的值相不相同，然后左孩子的左孩子节点与右孩子的右孩子节点、左孩子的右孩子节点与右孩子的左孩子节点是不是一致，如此判断遍历完整棵树就行。

递归法：

/**
 * 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 true;
       return check(root.left,root.right);
}
    public boolean check(TreeNode left,TreeNode right){
      if(left==null&&right==null)
      return true;
      if((left==null||right==null)||left.val!=right.val)
      return false;
      
      return check(left.left,right.right)&&check(left.right,right.left);
    }
}

迭代法：

class Solution {
    public boolean isSymmetric(TreeNode root) {
       if(root==null)return true;
       Queue<TreeNode> q=new LinkedList<>();
       TreeNode right=root.right;
       TreeNode left=root.left;
       if(left==null&&right==null)
       return true;
       q.offer(right);
       q.offer(left);
       while(!q.isEmpty()){
       right=q.poll();
       left=q.poll();
       if(right==null&&left==null)
       {
       continue;
       }
       if((right==null||left==null)||right.val!=left.val)
       {
       return false;
       }
       q.offer(left.left);
       q.offer(right.right);
       q.offer(left.right);
       q.offer(right.left);

       }
   return true;


}
}