二叉树的遍历-前序遍历-中序遍历-后序遍历

前序遍历

递归法：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def preorderTraversal(self, root: TreeNode) -> List[int]:    
        if root == None:
            return []

        res = [root.val]
        res += self.preorderTraversal(root.left)
        res += self.preorderTraversal(root.right)

        return res

迭代法：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def preorderTraversal(self, root: TreeNode) -> List[int]:
                
        queue = [] 
        res = []
        while root:
            res.append(root.val)

            if root.right != None:
                queue.append(root.right)
            if root.left is None :
                if len(queue)!=0:
                    root = queue[-1]
                    queue.pop(-1)
                else:
                    break
            else:
                root = root.left
            
        return res