leetcode 101.对称二叉树 Java

题目链接

https://leetcode-cn.com/problems/symmetric-tree/

描述

给定一个二叉树，检查它是否是镜像对称的。

示例

示例1

二叉树 [1,2,2,3,4,4,3] 是对称的。

    1
   / \
  2   2
 / \ / \
3  4 4  3

示例2

[1,2,2,null,3,null,3] 则不是镜像对称的:

    1
   / \
  2   2
   \   \
   3    3

代码

递归

递归写法，理解起来较为简单

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

    private boolean judge(TreeNode node1, TreeNode node2) {
        if (node1 == null && node2 == null) {
            return true;
        }
        if (node1 == null || node2 == null) {
            return false;
        }

        return node1.val == node2.val && judge(node1.left, node2.right) && judge(node1.right, node2.left);
    }
}

迭代

也可以根据迭代进行完成

class Solution {
    public boolean isSymmetric(TreeNode root) {
        Queue<TreeNode> queue = new LinkedList<>();

        queue.offer(root);
        queue.offer(root);

        while (!queue.isEmpty()) {
            for (int i = queue.size(); i > 0; i -= 2) {
                TreeNode node1 = queue.poll();
                TreeNode node2 = queue.poll();

                if (node1 == null && node2 == null) {
                    continue;
                }

                if ((node1 == null || node2 == null) || node1.val != node2.val) {
                    return false;
                }

                queue.offer(node1.left);
                queue.offer(node2.right);

                queue.offer(node1.right);
                queue.offer(node2.left);
            }
        }

        return true;
    }
}