题目描述
请实现一个函数按照之字形打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右至左的顺序打印,第三行按照从左到右的顺序打印,其他行以此类推。
/*
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) {
if(pRoot == nullptr) return vector<vector<int>>((0));
vector<vector<int>> result;
stack<TreeNode* > table[2];
vector<int> line;
int current = 0;
int next = 1;
table[current].push(pRoot);
while(!table[0].empty() || !table[1].empty())
{
TreeNode* temp = table[current].top();
table[current].pop();
line.push_back(temp->val);
if(current == 0){
if(temp->left) table[next].push(temp->left);
if(temp->right) table[next].push(temp->right);
}
else{
if(temp->right) table[next].push(temp->right);
if(temp->left) table[next].push(temp->left);
}
if(table[current].empty()){
result.push_back(line);
line.clear();
current = 1 - current;
next = 1 - next;
}
}
return result;
}
};