给定一个二叉树,返回其节点值的锯齿形层次遍历。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
例如:
给定二叉树 [3,9,20,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
返回锯齿形层次遍历如下:
[ [3], [20,9], [15,7] ]
class Solution {
public:
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
vector<vector<int>> res;
if(root==nullptr)
return res;
stack<TreeNode*> s1,s2;
s1.push(root);
while(!s1.empty() || !s2.empty()){
vector<int> temp;
if(!s1.empty()){
while(!s1.empty()){
TreeNode* node = s1.top();
s1.pop();
if(node->left!=nullptr)
s2.push(node->left);
if(node->right!=nullptr)
s2.push(node->right);
temp.push_back(node->val);
}
}else{
while(!s2.empty()){
TreeNode* node = s2.top();
s2.pop();
if(node->right!=nullptr)
s1.push(node->right);
if(node->left!=nullptr)
s1.push(node->left);
temp.push_back(node->val);
}
}
res.push_back(temp);
}
return res;
}
};