【算法刷题】二叉树Ⅰ

递归遍历

1. 确定递归函数的参数和返回值
2. 确定终止条件
3. 确定单层递归的逻辑

前序遍历

class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right

def preorderTraversal(self, root: TreeNode):
    # 若为空，直接返回空列表
    if not root:
        return []
    
    left = self.preorderTraversal(root.left)
    right = self.preorderTraversal(root.right)

    return [root.val] + left + right

中序遍历

def inorderTraversal(self, root: TreeNode):
    if not root:
        return []
    
    left = self.inorderTraversal(root.left)
    right = self.inorderTraversal(root.right)

    return left + [root.val] + right

后序遍历

def postorderTraversal(self, root: TreeNode):
    if not root:
        return []
    
    left = self.postorderTraversal(root.left)
    right = self.postorderTraversal(root.right)

    return left + right + [root.val]

层序遍历

def levelTraversal(self, root: TreeNode):
	if not root:
		return []
	
	queue = deque([root])
	res = []
	while queue:
		level = []
		n = len(queue)
		while n:
			n -= 1
			cur = queue.popleft()
			level.append(cur.val)
			if cur.left:
				queue.append(cur.left)
			if cur.right:
				queue.append(cur.right)
		res.append(level)