描述
给出一棵二叉树,返回其节点值的层次遍历(逐层从左往右访问)
首个数据为根节点,后面接着是其左儿子和右儿子节点值,"#"表示不存在该子节点。
节点数量不超过20。
样例 1:
输入:
tree = {1,2,3}
输出:
[[1],[2,3]]
样例 2:
输入:
tree = {1,#,2,3}
输出:
[[1],[2],[3]]
"""
Definition of TreeNode:
class TreeNode:
def __init__(self, val):
self.val = val
self.left, self.right = None, None
"""
class Solution:
"""
@param root: A Tree
@return: Level order a list of lists of integer
"""
def levelOrder(self, root):
# write your code here
result = []
target_level = 0
while True:
level = []
self.dfs(root, 0, target_level, level)
if not level:
break
result.append(level)
target_level += 1
return result
def dfs(self, root, cur_level, target_level, level):
if not root or cur_level > target_level:
return
if cur_level == target_level:
level.append(root.val)
self.dfs(root.left, cur_level+1, target_level, level)
self.dfs(root.right, cur_level+1, target_level, level)