leetcode 101.对称二叉树

题目描述：给定一个二叉树，检查它是否是镜像对称的。

解题思路：递归、迭代，使用两个指针镜像便利二叉树

解法一：递归

class Solution {
    public boolean isSymmetric(TreeNode root) {
        return check(root, root);
    }
    private boolean check(TreeNode p1, TreeNode p2) {
         if (p1 == null && p2 == null) {
             return true;
         }
         if (p1 == null || p2 == null) {
             return false;
         }
         return p1.val == p2.val && check(p1.left, p2.right) && check(p1.right, p2.left);
    }
}

解法二：迭代

class Solution {
    public boolean isSymmetric(TreeNode root) {
        return check(root, root);
    }
    // 迭代
    private boolean check(TreeNode p1, TreeNode p2) {
        Queue<TreeNode> q = new LinkedList<>();
        q.offer(p1);
        q.offer(p2);
        while (!q.isEmpty()) {
            TreeNode u = q.poll();
            TreeNode v = q.poll();
            if (u == null && v == null) {
                continue;
            }
            if (u == null || v == null || u.val != v.val) {
                return false;
            }
            
            q.offer(u.left);
            q.offer(v.right);
            q.offer(u.right);
            q.offer(v.left);
            
        }
        return true;
    }
}