103 binary-tree-zigzag-level-order-traversal
题目
给定一个二叉树,返回其节点值的锯齿形层次遍历。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
思路
层次遍历,用flag标记每一层是否需要reverse
/**
* 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) {
int flag = false;
queue<TreeNode*> que;
vector<vector<int>> ans;
if(!root)
return ans;
que.push(root);
TreeNode* cur;
int size;
vector<int> tmp;
while(!que.empty())
{
size = que.size();
tmp.clear();
for(int i=0;i<size;i++)
{
cur = que.front();
que.pop();
tmp.push_back(cur->val);
if(cur->left) que.push(cur->left);
if(cur->right) que.push(cur->right);
}
if(flag)
{
reverse(tmp.begin(), tmp.end());
}
ans.push_back(tmp);
flag = !flag;
}
return ans;
}
};
也可以用deque,用两端的push来代替vector的reverse
/**
* 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) {
int flag = false;
deque<TreeNode*> que;
vector<vector<int>> ans;
if(!root)
return ans;
que.push_back(root);
TreeNode* cur;
int size;
vector<int> tmp;
while(!que.empty())
{
size = que.size();
tmp.clear();
if(!flag)
{
for(int i=0;i<size;i++)
{
cur = que.front();
que.pop_front();
tmp.push_back(cur->val);
if(cur->left) que.push_back(cur->left);
if(cur->right) que.push_back(cur->right);
}
}
else
{
for(int i=0;i<size;i++)
{
cur = que.back();
que.pop_back();
tmp.push_back(cur->val);
if(cur->right) que.push_front(cur->right);
if(cur->left) que.push_front(cur->left);
}
}
ans.push_back(tmp);
flag = !flag;
}
return ans;
}
};