题目描述
从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。
思路
层次遍历,用一个变量记录一下每层的结点数目,把每层的结点单独存在一个vector里,最后放在结果里
code
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
class Solution {
public:
vector<vector<int> > Print(TreeNode* pRoot) {
queue<TreeNode*>q;
vector<vector<int>>res;
vector<int>layer;
if(pRoot==nullptr)
return res;
q.push(pRoot);
while(!q.empty()){
int qs=q.size();
while(qs--){
layer.push_back(q.front()->val);
if(q.front()->left)
q.push(q.front()->left);
if(q.front()->right)
q.push(q.front()->right);
q.pop();
}
res.push_back(layer);
layer.clear();
}
return res;
}
};