题目描述
从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。
根据队列的思路来做,记录每次需要打印的一行个数,内循环,打印完成后,压入 vec;直到队列为空
/*
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)
{
vector<vector<int> > vec;
queue<TreeNode*> q;
if(pRoot==NULL)
return vec;
q.push(pRoot);
while(!q.empty())
{
vector<int> num;
int j=q.size();
while(j)
{
TreeNode *t = q.front();
q.pop();
num.push_back(t->val);
if(t->left!=NULL)
{
q.push(t->left);
}
if(t->right!=NULL)
{
q.push(t->right);
}
j--;
}
vec.push_back(num);
}
return vec;
}
};