Question 102. Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
For example:
Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its level order traversal as:
[
[3],
[9,20],
[15,7]
]
二叉树的层次遍历并统计每层结点的数量
解决: 这里使用FIFO队列来实现,对于统计每层结点的统计,根据层次遍历时队列的特性可以直接获取并存入队列。
实现源码如下: