Easynode
246python
31bash
Favoriteapp
Share Given an n-ary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).ui
For example, given a 3-ary tree:spa
We should return its level order traversal:3d
[ [1], [3,2,4], [5,6] ]code
Note:cdn
The depth of the tree is at most 1000. The total number of nodes is at most 5000.blog
思路:廣度優先搜索
代碼:python3
class Solution(object):
def levelOrder(self, root):
from collections import deque
if not root:return []
q=deque([root])
arr=[]
while q:
level=[]
for c in range(len(q)):
cur = q.popleft()
for chi in cur.children:
q.append(chi)
level.append(cur.val)
arr.append(level)
return arr
複製代碼