101 Symmetric Tree

最新推荐文章于 2022-03-22 14:01:14 发布

dongbeier

最新推荐文章于 2022-03-22 14:01:14 发布

阅读量83

点赞数

分类专栏： MicroSoft Linkedin LeetCode

本文链接：https://blog.csdn.net/dongbeier/article/details/80276267

版权

LeetCode 同时被 3 个专栏收录

146 篇文章 0 订阅

订阅专栏

MicroSoft

85 篇文章 0 订阅

订阅专栏

50 篇文章 0 订阅

订阅专栏

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

But the following [1,2,2,null,3,null,3] is not:

Note:
Bonus points if you could solve it both recursively and iteratively.

递归

/**
 * 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 isSymmetric(root.left, root.right);
    }
    
    private boolean isSymmetric(TreeNode p, TreeNode q) {
        if (p == null && q == null)
            return true;
        if (p == null || q == null)
            return false;
        return p.val == q.val && 
            isSymmetric(p.left, q.right) && 
            isSymmetric(p.right, q.left);
    }
}

迭代

/**
 * 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> queue = new LinkedList<>();
        queue.offer(root.left);
        queue.offer(root.right);
        while (!queue.isEmpty()) {
            TreeNode p = queue.poll();
            TreeNode q = queue.poll();
            
            if (p == null && q == null) {
                continue;
            }
            
            if (p == null || q == null) {
                return false;
            }
            
            if (p.val != q.val) {
                return false;
            }
            queue.offer(p.left);
            queue.offer(q.right);
            
            queue.offer(p.right);
            queue.offer(q.left);
        }
        return true;
    }
}