leetcode-101. Symmetric Tree

最新推荐文章于 2024-07-09 23:43:07 发布

KpLn_HJL

最新推荐文章于 2024-07-09 23:43:07 发布

阅读量456

点赞数

分类专栏： OJ题目记录文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/sinat_41679123/article/details/130381394

版权

OJ题目记录专栏收录该内容

515 篇文章 1 订阅

订阅专栏

Description

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

Example 1:

在这里插入图片描述

Input: root = [1,2,2,3,4,4,3]
Output: true
Example 2:
在这里插入图片描述

Input: root = [1,2,2,null,3,null,3]
Output: false

Constraints:

The number of nodes in the tree is in the range [1, 1000].
-100 <= Node.val <= 100

Follow up: Could you solve it both recursively and iteratively?

Solution

The tree is symmetric if and only if: left.left = right.right and left.right = right.left, so we use a queue to keep track of all the nodes that we visited.

Time complexity: $o (n)$
Space complexity: $o (n)$

Recursively, we need both left and right nodes to decide whether it’s symmetric or not, so the recursive function will be f(left, right)

Code

iteratively

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def isSymmetric(self, root: Optional[TreeNode]) -> bool:
        queue = collections.deque([(root.left, root.right)])
        while queue:
            left, right = queue.popleft()
            if not left and not right:
                continue
            if not left or not right:
                return False
            if left.val != right.val:
                return False
            queue.append((left.left, right.right))
            queue.append((right.left, left.right))
        return True

recursively

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def isSymmetric(self, root: Optional[TreeNode]) -> bool:
        def helper(left, right) -> bool:
            if not left and not right:
                return True
            if not left or not right:
                return False
            return left.val == right.val and helper(left.left, right.right) and helper(right.left, left.right)
        return helper(root.left, root.right)