题目描述
请实现一个函数按照之字形打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右至左的顺序打印,第三行按照从左到右的顺序打印,其他行以此类推。
牛客链接:
https://www.nowcoder.com/practice/91b69814117f4e8097390d107d2efbe0?tpId=13&&tqId=11212&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
解题思路:
用两个栈实现,具体如图
参考链接:
https://www.nowcoder.com/questionTerminal/91b69814117f4e8097390d107d2efbe0
代码:
/*
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>> result;
if(pRoot == NULL) return result;
stack<TreeNode*> stk1, stk2;
TreeNode* pTemp = pRoot;
stk1.push(pTemp);
while(!stk1.empty() || !stk2.empty()) {
vector<int> temp1;
vector<int> temp2;
while(!stk1.empty()) {
pTemp = stk1.top();
stk1.pop();
temp1.push_back(pTemp->val);
if(pTemp->left) {
stk2.push(pTemp->left);
}
if(pTemp->right) {
stk2.push(pTemp->right);
}
}
if(temp1.size()>0) {
result.push_back(temp1);
}
while(!stk2.empty()) {
pTemp = stk2.top();
stk2.pop();
temp2.push_back(pTemp->val);
if(pTemp->right) {
stk1.push(pTemp->right);
}
if(pTemp->left) {
stk1.push(pTemp->left);
}
}
if(temp2.size()>0){
result.push_back(temp2);
}
}
return result;
}
};
注意:
二叉树的层序遍历