二叉树的层次遍历,借助一个队列,每次弹出队列的头节点,只要其子节点不为空,入队。
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def levelOrder(self, root: TreeNode) -> List[int]:
if not root:return []
que = [root]
res = []
while que:
node = que.pop(0)
res.append(node.val)
if node.left:
que.append(node.left)
if node.right:
que.append(node.right)
return res