今天又长姿势了,哈哈,fighting,一切都在代码中
class Solution(object):
def levelOrder(self, root):
"""
:type root: TreeNode
:rtype: List[List[int]]
"""
# 最终结果
res = []
# 存放每一层结果
levelRes = []
if root == None:
return res
# 当前一层的节点
current = []
# 下一层的节点
next = []
# 根节点加入
current.append(root)
while len(current) > 0:
# 弹出第一个元素
node = current.pop(0)
if node.left != None:
next.append(node.left)
if node.right != None:
next.append(node.right)
# 加入访问节点的值
levelRes.append(node.val)
if len(current) == 0:
current = next
next = []
res.append(levelRes)
levelRes = []
return res