-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy pathsolution102.cpp
More file actions
84 lines (78 loc) · 1.56 KB
/
solution102.cpp
File metadata and controls
84 lines (78 loc) · 1.56 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
75
76
77
78
79
80
81
82
83
84
/**
* Binary Tree Level Order Traversal
*
* cpselvis([email protected])
*/
#include<iostream>
#include<vector>
using namespace std;
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) {
vector<vector<int>> ret;
vector<TreeNode*> nodes;
if (root != NULL)
{
nodes.push_back(root);
dfs(nodes, ret);
}
return ret;
}
void dfs(vector<TreeNode*> &nodes, vector<vector<int>> &ret)
{
vector<int> vals;
vector<TreeNode*> childNodes;
if (nodes.size() == 0)
{
return;
}
for (int i = 0; i < nodes.size(); i ++)
{
if (nodes[i] != NULL)
{
vals.push_back(nodes[i] -> val);
if (nodes[i] -> left != NULL)
{
childNodes.push_back(nodes[i] -> left);
}
if (nodes[i] -> right != NULL)
{
childNodes.push_back(nodes[i] -> right);
}
}
}
ret.push_back(vals);
dfs(childNodes, ret);
}
};
int main(int argc, char **argv)
{
// Test
// 3
// / \
// 9 20
// / \
// 15 7
TreeNode *root = new TreeNode(3);
root -> left = new TreeNode(9);
root -> right = new TreeNode(20);
root -> right -> left = new TreeNode(15);
root -> right -> right = new TreeNode(7);
Solution s;
vector<vector<int>> ret = s.levelOrder(root);
for (auto i : ret)
{
cout << "Level start.." << endl;
for (auto j : i)
{
cout << j << ' ';
}
cout << "Level end.." << endl;
}
}