题目描述
给定一个二叉树,返回其节点值的锯齿形层次遍历。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
示例
例如:
给定二叉树 [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回锯齿形层次遍历如下:
[
[3],
[20,9],
[15,7]
]
思路
这题较上题leetcode102. 二叉树的层次遍历,多了一个要求,即每一层打印顺序逐层变化,用两个栈可以实现。
注意。第一个栈先放右在放左,第二个栈先放左再放右。。。(其实用一个栈一个队列就不用分了)
代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
vector<vector<int>> res;
if (!root) return res;
stack<TreeNode*> s1;
stack<TreeNode*> s2;
s1.push(root);
while (!s1.empty() || !s2.empty()){
vector<int> item;
if (!s1.empty()){
int size = s1.size();
for (int i = 0; i < size; i++){
TreeNode* cur = s1.top();
s1.pop();
item.push_back(cur->val);
if (cur->left)
s2.push(cur->left);
if (cur->right)
s2.push(cur->right);
}
}
else{
int size = s2.size();
for (int i = 0; i < size; i++){
TreeNode* cur = s2.top();
s2.pop();
item.push_back(cur->val);
if (cur->right)
s1.push(cur->right);
if (cur->left)
s1.push(cur->left);
}
}
res.push_back(item);
}
return res;
}
};