2022年02月13日-4- 对称二叉树

给你一个二叉树的根节点 root ， 检查它是否轴对称。

示例 1：

输入：root = [1,2,2,3,4,4,3]
输出：true
示例 2：

输入：root = [1,2,2,null,3,null,3]
输出：false

提示：

树中节点数目在范围 [1, 1000] 内
-100 <= Node.val <= 100

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) {
        return check(root, root);
    }

    //方法一 递归
    // private boolean check(TreeNode r1, TreeNode r2) {
    //     if(r1 == null && r2 == null) {
    //         return true;
    //     }

    //     if(r1 == null || r2 == null || r1.val != r2.val) {
    //         return false;
    //     }

    //     return check(r1.left, r2.right) && check(r1.right, r2.left);
    // }

    //方法2 迭代
    private boolean check(TreeNode r1, TreeNode r2) {
          Queue<TreeNode> q = new LinkedList<TreeNode>();
        q.offer(r1);
        q.offer(r2);

        while ( !q.isEmpty()) {
            r1 = q.poll();
            r2 = q.poll();

            if(r1 == null && r2 == null) {
                continue;
            }

            if( r1== null || r2 == null || r1.val != r2.val) {
                return false;
            }

            q.offer(r1.left);
            q.offer(r2.right);

            q.offer(r2.left);
            q.offer(r1.right);

        }

        return true;
    }


}