本文共 866 字，大约阅读时间需要 2 分钟。

前序[0, 1, 3, 4, 2]

# Definition for a binary tree node.from typing import Listclass TreeNode:    def __init__(self, val=0, left=None, right=None):        self.val = val        self.left = left        self.right = rightclass Solution:    def inorderTraversal(self, root: TreeNode) -> List[int]:        res = []        def dfs(root):            if not root:                return            res.append(root.val)            dfs(root.left)            dfs(root.right)        dfs(root)        return resroot = TreeNode(0)lc = TreeNode(1)rc = TreeNode(2)lc_lc = TreeNode(3)lc_rc = TreeNode(4)root.left = lcroot.right = rclc.left=lc_lclc.right=lc_rcprint(Solution().inorderTraversal(root))

中序 [3, 1, 4, 0, 2]

dfs(root.left)            res.append(root.val)            dfs(root.right)

后序 [3, 4, 1, 2, 0]

dfs(root.left)            dfs(root.right)            res.append(root.val)

转载地址：http://qdce.baihongyu.com/