forked from BhaskarJoshi-01/HactoberFest2021
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Leetcode_Binary_tree_zigzag_traversal.cpp
53 lines (32 loc) · 1.15 KB
/
Leetcode_Binary_tree_zigzag_traversal.cpp
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
/*
Given the root of a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level and alternate between).
*/
class Solution {
public:
void solve(TreeNode* root,vector<vector<int>>&v){
if(!root)
return ;
queue<TreeNode*>q;
q.push(root);
bool ltr=true;
while(!q.empty()){
int s=q.size();
vector<int>level(s);
for(int i=0;i<s;i++){
TreeNode* node=q.front();
q.pop();
int index=(ltr)?i:(s-i-1);
level[index]=node->val;
if(node->left) q.push(node->left);
if(node->right) q.push(node->right);
}
ltr=!ltr;
v.push_back(level);
}
}
vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
vector<vector<int>>v;
solve(root,v);
return v;
}
};