{leetcode}/problems/binary-tree-level-order-traversal/[LeetCode - 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] ]
- 一刷
-
link:{sourcedir}/_0102_BinaryTreeLevelOrderTraversal.java[role=include] - 二刷
-
link:{sourcedir}/_0102_BinaryTreeLevelOrderTraversal_2.java[role=include] - 三刷
-
link:{sourcedir}/_0102_BinaryTreeLevelOrderTraversal_3.java[role=include]
|
Tip
|
TODO：还可以优化成只用一个队列对象，思考如何实现？ |