LeetCode 101 对称二叉树 Java

题目描述

给定一个二叉树，检查它是否是镜像对称的。
如果你可以运用递归和迭代两种方法解决这个问题，会很加分。

代码

1.递归实现

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isSymmetric(TreeNode root) {
        if (root == null) return true;
        return isMirror(root.left, root.right);
    }

    public boolean isMirror(TreeNode left, TreeNode right){
        if (left == null || right == null){ // 退出条件：其中一个是null时，若另一个也是null返回true，否则返回false
            return left == right;
        }
        if (left.val != right.val){
            return false;
        }
        return isMirror(left.left, right.right) && isMirror(left.right, right.left);
    }
}

2.迭代实现

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isSymmetric(TreeNode root) {
        if (root == null) return true;
        Queue<TreeNode> q = new LinkedList<>();
        q.offer(root.left);
        q.offer(root.right);
        while(!q.isEmpty()){
            TreeNode tmp1 = q.poll();
            TreeNode tmp2 = q.poll();
            if (tmp1 == null && tmp2 == null) continue;
            if (tmp1 == null || tmp2 == null) return false;
            if (tmp1.val != tmp2.val) return false;
            q.offer(tmp1.left);
            q.offer(tmp2.right);
            q.offer(tmp1.right);
            q.offer(tmp2.left);
        }
        return true;
    }
}