leetcode学习笔记(二叉树的前/中/后序遍历-递归/迭代)

最新推荐文章于 2024-11-11 20:59:17 发布

2023好运来

最新推荐文章于 2024-11-11 20:59:17 发布

阅读量68

点赞数

分类专栏：学习记录文章标签： leetcode

本文链接：https://blog.csdn.net/qq_43656500/article/details/120758873

版权

学习记录专栏收录该内容

103 篇文章 0 订阅

订阅专栏

144. 二叉树的前序遍历

在这里插入图片描述

迭代

先找到最左边的点
一步一步退回来加上右边的点

class Solution:
    def preorderTraversal(self, root: TreeNode) -> List[int]:
        res = []
        if not root:
            return res
        
        stack = []
        node = root
        while stack or node:
            while node:
                res.append(node.val)
                stack.append(node)
                node = node.left#直到最左侧的点
            node = stack.pop()#退回一层
            node = node.right#右边的点
        return res

递归

class Solution:
    def preorderTraversal(self, root: TreeNode) -> List[int]:
        def preorder(root: TreeNode):
            if not root:
                return
            res.append(root.val)
            preorder(root.left)
            preorder(root.right)
        
        res = []
        preorder(root)
        return res

94. 二叉树的中序遍历

在这里插入图片描述

迭代

class Solution:
    def inorderTraversal(self, root: TreeNode) -> List[int]:
        res = []
        if not root:
            return res

        stack = []
        node = root
        while stack or node:
            while node:
                stack.append(node)
                node = node.left
            node = stack.pop()
            res.append(node.val)
            node = node.right
            
        return res

递归

class Solution:
    def inorderTraversal(self, root: TreeNode) -> List[int]:
        def preorder(root: TreeNode):
            if not root:
                return
                           
            preorder(root.left)
            res.append(root.val)
            preorder(root.right)
        
        res = []
        preorder(root)
        return res

145. 二叉树的后序遍历

在这里插入图片描述

迭代

class Solution:
    def postorderTraversal(self, root: TreeNode) -> List[int]:
        res = []
        if not root:
            return res
        
        stack = []
        node = root 
        prev = None
       
        while node or stack:
            while node:
                stack.append(node)
                node = node.left#找最左边的点
            node = stack.pop()
            if not node.right or node.right == prev:
                res.append(node.val)
                prev = node
                node = None
            else:
                stack.append(node)
                node = node.right
        
        return res

递归

        def preorder(root: TreeNode):
            if not root:
                return
            res.append(root.val)
            preorder(root.left)
            preorder(root.right)
        
        res = []
        preorder(root)
        return res