[递归]二叉树的三种遍历

最新推荐文章于 2022-09-20 16:44:46 发布

21座的胖子

最新推荐文章于 2022-09-20 16:44:46 发布

阅读量108

点赞数

本文链接：https://blog.csdn.net/qq_35498453/article/details/116530914

版权

这篇博客详细介绍了二叉树的三种遍历方式：前序遍历（中→左→右）、中序遍历（左→中→右）和后序遍历（左→右→中）。前序遍历常用于复制整棵树，中序遍历可得到有序数组，后序遍历适用于删除节点操作。每种遍历都通过递归实现，并给出了相应的代码实现。

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

前序遍历

遍历顺序：中→左→右

# 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 preorderTraversal(self, root: TreeNode) -> List[int]:
        def preorder(root: TreeNode):
            if root:
                res.append(root.val)
                preorder(root.left)
                preorder(root.right) 
        res = []    
        preorder(root)
        return res

中序遍历

遍历顺序：左→中→右，遍历后得到有序数组

# 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 preorderTraversal(self, root: TreeNode) -> List[int]:
        def preorder(root: TreeNode):
            if root:
                preorder(root.left)
                res.append(root.val)
                preorder(root.right) 
        res = []    
        preorder(root)
        return res

后序遍历

遍历顺序：左→右→中，删除某结点时使用的是后序遍历，删除两个孩子结点后删除该结点

# 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 preorderTraversal(self, root: TreeNode) -> List[int]:
        def preorder(root: TreeNode):
            if root:
                preorder(root.left)
                preorder(root.right) 
                res.append(root.val)
        res = []    
        preorder(root)
        return res