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,#,#,15,7},
3
/ \
9 20
/ \
15 7
return its level order traversal as:
[
[3],
[9,20],
[15,7]
]
思路:这道题同样可以用层序遍历的思想,定义一个队列Q,指针front,rear分别记录每一层节点在Q中的起始坐标和终点坐标,然后遍历取得节点的值即可。
class Solution {
public:
vector<vector<int> > levelOrder......
阅读全文