leetCode429 N叉树的层序遍历
给定一个 N 叉树,返回其节点值的层序遍历。(即从左到右,逐层遍历)。
树的序列化输入是用层序遍历,每组子节点都由 null 值分隔(参见示例)。
示例 1:
输入:root = [1,null,3,2,4,null,5,6]
输出:[[1],[3,2,4],[5,6]]
示例 2:
输入:root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
输出:[[1],[2,3,4,5],[6,7,8,9,10],[11,12,13],[14]]
提示:
树的高度不会超过 1000
树的节点总数在 [0, 10^4] 之间
DFS
"""
# Definition for a Node.
class Node:
def __init__(self, val=None, children=None):
self.val = val
self.children = children
"""
class Solution:
def levelOrder(self, root: 'Node') -> List[List[int]]:
#注意root的:后面是形参注释,->箭头后面的是函数返回值注释,可以去掉
ans = []
def DFS(root, depth):
if not root: return
if len(ans) <= depth:
ans.append([]) #在记录整个结果的列表中加入记录该层的列表
ans[depth].append(root.val) #在该层深度下添加结点值后继续深搜
for child in root.children: #for 横向遍历当前结点孩子
DFS(child, depth + 1)
DFS(root, 0)
return ans
BFS
"""
# Definition for a Node.
class Node:
def __init__(self, val=None, children=None):
self.val = val
self.children = children
"""
class Solution:
def levelOrder(self, root: 'Node') -> List[List[int]]:
ans = []
def BFS(root):
if not root: return
thisLayer = [root]
while thisLayer:
nextLayer = []
thisLayer_val = []
for thisLayer_node in thisLayer:
thisLayer_val.append(thisLayer_node.val) #储存当前层结点的值
for child in thisLayer_node.children:
nextLayer.append(child) #储存下一层结点
ans.append(thisLayer_val) #将当前层结点的值存入整个结果列表
thisLayer = nextLayer #将下一层更新到当前层
BFS(root)
return ans