Leetcode Binary Tree BFS解題心得

res, current = [], [root]while current:  n = len(current)  res.append(current[-1].val)  for i in range(n):    temp = current.pop(0)    if temp.left:      current.append(temp.left)    if temp.right:      current.append(temp.right)