请实现一个函数按照之字形打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右至左的顺序打印,第三行按照从左到右的顺序打印,其他行以此类推。·
/*
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> > res;
if(pRoot==nullptr)
return res;
stack<TreeNode*> ji;
ji.push(pRoot);
stack<TreeNode*> ou;
vector<int> tmp;
int layer=1;
while(!ji.empty() || !ou.empty()){
if(layer%2==1){
while(!ji.empty()){
TreeNode* p1=ji.top();
ji.pop();
tmp.push_back(p1->val);
if(p1->left!=nullptr)
ou.push(p1->left);
if(p1->right!=nullptr)
ou.push(p1->right);
}
if(!tmp.empty()){
res.push_back(tmp);
layer++;
tmp.clear();
}
}else{
while(!ou.empty()){
TreeNode* p2=ou.top();
ou.pop();
tmp.push_back(p2->val);
if(p2->right!=nullptr)
ji.push(p2->right);
if(p2->left!=nullptr)
ji.push(p2->left);
}
if(!tmp.empty()){
res.push_back(tmp);
layer++;
tmp.clear();
}
}
}
return res;
}
};