bfs
class Solution:
def levelOrder(self, root: 'Node') -> List[List[int]]:
q,ans=[root],[]
while q and q[0]:
ans.append([node.val for node in q])
q=[child for node in q for child in node.children if child]
return ans
相关文章
- Leetcode 429. N-ary Tree Level Order Traversal
- [LeetCode] Binary Tree Level Order Traversal II 二叉树层序遍历之二
- LeetCode(32)-Binary Tree Level Order Traversal
- Leetcode 102. Binary Tree Level Order Traversal（二叉树的层序遍历）
- Binary Tree Level Order Traversal java实现
- 102. Binary Tree Level Order Traversal二叉树层序遍历
- 剑指offer从上往下打印二叉树 、leetcode102. Binary Tree Level Order Traversal(即剑指把二叉树打印成多行、层序打印）、107. Binary Tree Level Order Traversal II 、103. Binary Tree Zigzag Level Order Traversal(剑指之字型打印)
- Java [Leetcode 102]Binary Tree Level Order Traversal
- LeetCode题解之Binary Tree Level Order Traversal II
- [LeetCode]Binary Tree Level Order Traversal