题解 | #求二叉树的层序遍历#
求二叉树的层序遍历
http://www.nowcoder.com/practice/04a5560e43e24e9db4595865dc9c63a3
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
#
# @param root TreeNode类
# @return int整型二维数组
#
class Solution:
def levelOrder(self , root: TreeNode) -> List[List[int]]:
# write code here
result = []
def level_order(node,level):
if not node or node.val == '#':
return None
else:
if len(result) < level:
result.append([])
result[level-1].append(node.val)
level_order(node.left,level+1)
level_order(node.right,level+1)
level_order(root,1)
return result
投递腾讯音乐娱乐集团等公司7个岗位
