剑指offer:面试题60——把二叉树打印成多行
题目:从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。
思路:二叉树的层序遍历,每次放入一个节点的左右孩子时,当前层数拥有节点数nextLevel++,每次pop一个节点,则待打印节点数toBepop–。当该层的toBepop减为0时说明本层打印结束,则应该打印回车,并且将下一层应该打印的节点值更新。
/*
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 >>retval;
if(pRoot==NULL)return retval;
queue<TreeNode*> nodes;
nodes.push(pRoot);
int nextLevel=0;
int toBePrint=1;
vector<int> level;
while(!nodes.empty())
{
TreeNode* pNode=nodes.front();
level.push_back(pNode->val);
if(pNode->left!=NULL)
{
nodes.push(pNode->left);
++nextLevel;
}
if(pNode->right!=NULL)
{
nodes.push(pNode->right);
++nextLevel;
}
nodes.pop();
--toBePrint;
if(toBePrint==0)
{
retval.push_back(level);
while(level.size()!=0)
level.pop_back();
toBePrint=nextLevel;
nextLevel=0;
}
}
return retval;
}
};