二叉树遍历算法(python)

1 先序遍历

(1) 递归实现

def pre_order_trav(root: TreeNode):
    """先序遍历, 根左右"""
    if root is None:
        return []
    return [root.val] + pre_order_trav(root.left) + pre_order_trav(root.right)

(2) 迭代实现

def pre_order_trav(root: TreeNode):
    """先序遍历, 根左右"""
    stack = []
    ret = []
    cur = root
    while stack or cur:
        if cur:
            ret.append(cur.val)
            stack.append(cur.right)
            cur = cur.left
        else:
            cur = stack.pop()
    return ret

2 后序遍历

(1) 递归实现

def post_order_trav(root: TreeNode):
    """后序遍历, 左右根"""
    if root is None:
        return []
    return post_order_trav(root.left) + post_order_trav(root.right) + [root.val]

(2) 迭代实现

def post_order_trav(root: TreeNode):
    """后序遍历, 左右根"""
    stack = []
    ret = []
    cur = root
    while stack or cur:
        if cur:  # 先输出为根右左
            ret.append(cur.val)
            stack.append(cur.left)
            cur = cur.right
        else:
            cur = stack.pop()
    return ret[::-1]  # 根右左 逆序变为 左右根

3 中序遍历

(1) 递归实现

def in_order_trav(root: TreeNode):
    """中序遍历, 左根右"""
    if root is None:
        return []
    return in_order_trav(root.left) + in_order_trav(root.right) + [root.val]

(2) 迭代实现

def in_order_trav(root: TreeNode):
    """中序遍历, 左根右"""
    stack = []
    ret = []
    cur = root
    while stack or cur:
        if cur:
            stack.append(cur)
            cur = cur.left
        else:
            cur = stack.pop()
            ret.append(cur.val)
            cur = cur.right
    return ret

4 层次遍历

(1) 递归实现

def level_order_trav(root: TreeNode):
    def trav_level(node, level):
        if node is None:
            return
        ret[level-1].append(node.val)
        if len(ret) == level:
            ret.append([])  # 遍历到新行之前, 添加新行
        trav_level(node.left, level+1)
        trav_level(node.right, level+1)
    ret = [[]]  # 每一个子列表保存了对应index层的从左到右的所有结点value值
    trav_level(root, 1)
    rr = [i for r in ret for i in r]
    return rr

(2) 迭代实现

def level_order_trav(root: TreeNode):
    """层次遍历"""
    q = [root]
    ret = []
    while q:
        node = q.pop(0)
        ret.append(node.val)
        if node.left:
            q.append(node.left)
        if node.right:
            q.append(node.right)
    return ret