二叉树的遍历

二叉树的层序遍历（非递归实现，使用队列）

def levelOrder(root: TreeNode) -> List[List[int]]:
    if root is None:
        return []
    queen = []
    tree = []
    queen.append(root)
    while len(queen) != 0:
        level = []
        for _ in range(len(queen)):
            p = queen.pop(0)
            level.append(p.val)
            if p.left is not None:
                queen.append(p.left)
            if p.right is not None:
                queen.append(p.right)
        tree.append(level)
    return tree

二叉树的前序遍历

递归：

def preorderTraversal(root: TreeNode) -> List[int]:
    def preorder(root):
        if root is None:
            return
        tree.append(root.val)
        preorder(root.left)
        preorder(root.right)
    tree = []
    preorder(root)
    return tree

迭代：

def preorderTraversal(root: TreeNonde) -> List[int]:
    if root is None:
        return []
    p = root
    tree = []
    stack = []
    while stack or p:
        while p:
            stack.append(p)
            tree.append(p.val)
            p = p.left
        p = stack.pop()
        p = p.right
    return tree

二叉树的中序遍历

递归：

def inorderTraversal(root: TreeNode) -> List[int]:
    def inorder(root: TreeNode):
        if root is None:
            return
        inorder(root.left)
        tree.append(root.val)
        inorder(root.right)
    tree = []
    inorder(root)
    return tree

迭代：

def inorderTraversal(root: TreeNode) -> List[int]:
    if root is None:
        return []
    p = root
    tree = []
    stack = []
    while stack or p:
        while p:
            stack.append(p)
            p = p.left
        p = stack.pop()
        tree.append(p.val)
        p = p.right
    return tree

二叉树的后序遍历

递归：

def postorderTraversal(root: TreeNode) -> List[int]:
    def postorder(root: TreeNode):
        if root is None:
            return
        postorder(root.left)
        postorder(root.right)
        tree.append(root.val)
        
    tree = []
    postorder(root)
    return tree

迭代：

def postorderTraversal(root: TreeNode) -> List[int]:
    if root is None:
        return []
    p = root
    tree = []
    stack = []
    prev = None
    while stack or p:
        while p:
            stack.append(p)
            p = p.left
        p = stack.pop()
        if p.right is None or p.right == prev:
            tree.append(p.val)
            prev = p
            p = None
        else:
            stack.append(p)
            p = p.right
    return tree