forked from larissalages/code_problems
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path102.cpp
More file actions
40 lines (38 loc) · 1.15 KB
/
102.cpp
File metadata and controls
40 lines (38 loc) · 1.15 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
/**
* 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:
void levelTraverse(TreeNode* node,int level,vector<int> &levelElems){
if(!node) return;
if(level==1){
levelElems.push_back(node->val);
}else{
levelTraverse(node->left,level-1,levelElems);
levelTraverse(node->right,level-1,levelElems);
}
}
int height(TreeNode* node){
if(!node) return 0;
return max(height(node->left),height(node->right))+1;
}
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> v;
vector<int> levelElems;
int h=height(root);
for(int level=1;level<=h;level++){
levelElems.clear();
levelTraverse(root,level,levelElems);
v.push_back(levelElems);
}
return v;
}
};