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

python
# Definition for a binary tree node.
from typing import List
class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right
class 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 res
root = TreeNode(0)
lc = TreeNode(1)
rc = TreeNode(2)
lc_lc = TreeNode(3)
lc_rc = TreeNode(4)
root.left = lc
root.right = rc
lc.left=lc_lc
lc.right=lc_rc
print(Solution().inorderTraversal(root))

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

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

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

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