101. 对称二叉树

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

题目要求

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

递归

/**
 * 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 root == null || isSame(root.left, root.right);
    }

    public boolean isSame(TreeNode l, TreeNode r) {
        if (l == null && r != null || l != null && r == null) return false;
        if (l == null || r == null) return true;
        if (l.val != r.val) return false;
        return isSame(l.right, r.left) && isSame(l.left, r.right);
    }
}

迭代

/**
 * 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) {
        Deque<TreeNode> deque = new LinkedList<>();
        deque.offerFirst(root.left);
        deque.offerLast(root.right);
        while (!deque.isEmpty()) {
            TreeNode l = deque.pollFirst();
            TreeNode r = deque.pollLast();
            if (l == null && r == null) continue;
            if (l == null || r == null || l.val != r.val) return false;
            deque.offerFirst(l.right);
            deque.offerFirst(l.left);
            deque.offerLast(r.left);
            deque.offerLast(r.right);
        }
        return true;
    }
}

思路

• 值得注意的是，使用迭代的方法时，双端队列要使用LinkedList而不能使用ArrayDeque，否则结果错误，原因是因为树中包含null节点，但ArrayDeque不允许null元素，而LinkedList则允许null元素。