层序遍历二叉树

层序遍历二叉树

输入：root = [8,17,21,18,null,null,6]
输出：[8,17,21,18,6]

# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def decorateRecord(self, root: Optional[TreeNode]) -> List[int]:
        if not root:
            return []
        res = []
        cur = []
        whilr cur:
        	nxt = []
        	for node in cur:
        		res.append(node.val)
        		if node.left:nxt.append(node.left)
        		if node.right:nxt.append(node.right)
        	cur = nxt
       	return res

②使用队列

# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def decorateRecord(self, root: Optional[TreeNode]) -> List[int]:
        if not root:
            return []
        q = deque([root])
        res = []
        while q:
        	for _ in range(len(q)):
        		node = q.popleft()
        		res.append(node.val)
        		if node.left:q.append(node.left)
        		if node.right:q.append(node.right)