代码随想录算法训练营第15天

最新推荐文章于 2024-07-24 23:49:50 发布

研三小学渣

最新推荐文章于 2024-07-24 23:49:50 发布

阅读量338

点赞数 7

文章标签： python 开发语言

本文链接：https://blog.csdn.net/weixin_44733295/article/details/135909738

版权

本文介绍了如何使用Python实现二叉树的后序遍历、层序遍历，以及二叉树的翻转操作和对称性检查。通过递归和迭代方法展示了这些基础二叉树操作的实现过程。

摘要由CSDN通过智能技术生成

145. 二叉树的后序遍历

class Solution:
    def postorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
        path = []
        if not root:
            return []
        def dfs(root):
            if root.left:
                dfs(root.left)
            if root.right:
                dfs(root.right)
            path.append(root.val)
        dfs(root)
        return path

102. 二叉树的层序遍历

class Solution:
    def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
        if not root:
            return []
        deque_ = collections.deque()
        deque_.append(root)
        result = []
        while deque_:
            tmp = []
            for i in range(len(deque_)):
                node = deque_.popleft()
                tmp.append(node.val)
                if node.left:
                    deque_.append(node.left)
                if node.right:
                    deque_.append(node.right)
            result.append(tmp)
        return result

226. 翻转二叉树

class Solution:
    def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
        if not root:
            return None
        root.left,root.right = root.right,root.left
        self.invertTree(root.left)
        self.invertTree(root.right)
        return root

101. 对称二叉树

class Solution:
    def isSymmetric(self, root: Optional[TreeNode]) -> bool:
        if not root:
            return True
        return self.compare(root.left,root.right)
    def compare(self,left,right):
        if not left and not right:
            return True
        elif not left and right:
            return False
        elif not right and left:
            return False
        elif left.val !=right.val:
            return False
        outside = self.compare(left.left,right.right)
        inside = self.compare(left.right,right.left)
        return outside and inside