/**
* 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*> l; //左到右遍历
stack<TreeNode*> r; //右到左遍历
l.push(root);
while(!l.empty() || !r.empty()){
vector<int> tmp;
while(!l.empty()){
tmp.push_back(l.top()->val);
if(l.top()->left)
r.push(l.top()->left);
if(l.top()->right)
r.push(l.top()->right);
l.pop();
}
res.push_back(tmp); tmp.clear();
if(!r.empty()){
while(!r.empty()){
tmp.push_back(r.top()->val);
if(r.top()->right)
l.push(r.top()->right);
if(r.top()->left)
l.push(r.top()->left);
r.pop();
}
res.push_back(tmp); tmp.clear();
}
}
return res;
}
};
103. 二叉树的锯齿形层次遍历
最新推荐文章于 2023-04-04 13:00:00 发布