-
Notifications
You must be signed in to change notification settings - Fork 14
Expand file tree
/
Copy path102.levelOrder.cpp
More file actions
42 lines (37 loc) · 942 Bytes
/
102.levelOrder.cpp
File metadata and controls
42 lines (37 loc) · 942 Bytes
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
/**
* 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>> levelOrder(TreeNode* root) {
queue<TreeNode*> q;
queue<int> level;
q.push(root);
level.push(0);
int cur = -1;
vector<vector<int>> ans;
while(!q.empty()) {
TreeNode* node = q.front();
int l = level.front();
q.pop();
level.pop();
if (node == NULL) continue;
if (l > cur) {
cur = l;
ans.push_back(vector<int>());
}
ans[cur].push_back(node->val);
level.push(cur+1);
q.push(node->left);
level.push(cur+1);
q.push(node->right);
}
return ans;
}
};