-
Notifications
You must be signed in to change notification settings - Fork 23
Expand file tree
/
Copy pathlevelorder_zigZag.cpp
More file actions
74 lines (68 loc) · 1.8 KB
/
levelorder_zigZag.cpp
File metadata and controls
74 lines (68 loc) · 1.8 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
vector<vector<int>>v;
queue<TreeNode*>q;
if(!root)
{
return v;
}
q.push(root);
int level=0;
while(!q.empty())
{
int n=q.size();
vector<int>vec;
if(level%2==0)
{
for(int i=0;i<n;i++)
{
auto value=q.front();
q.pop();
vec.push_back(value->val);
if(value->left)
{
q.push(value->left);
}
if(value->right)
{
q.push(value->right);
}
}
}
if(level%2!=0)
{
for(int i=0;i<n;i++)
{
auto temp=q.front();
q.pop();
vec.push_back(temp->val);
if(temp->left)
{
q.push(temp->left);
}
if(temp->right)
{
q.push(temp->right);
}
}
reverse(vec.begin(),vec.end());
}
v.push_back(vec);
vec.clear();
level++;
}
return v;
}
};