层次遍历二叉树,用一个队列模拟就可以了
# 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 []
import collections
cur = []
queue = collections.deque()
queue.append(root)
while queue:
p = queue.popleft()
cur.append(p.val)
if p.left:
queue.append(p.left)
if p.right:
queue.append(p.right)
return cur