-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinaryTreeLevelOrderTraversal2.cc
More file actions
40 lines (37 loc) · 1.31 KB
/
BinaryTreeLevelOrderTraversal2.cc
File metadata and controls
40 lines (37 loc) · 1.31 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
// https://oj.leetcode.com/problems/binary-tree-level-order-traversal-ii/
namespace BinaryTreeLevelOrderTraversal2 {
class Solution {
public:
void doJob(vector<TreeNode *> &nodes, vector<vector<int> > &res) {
vector<TreeNode *> nextLevelNodes;
for (int i = 0; i < nodes.size(); i++) {
TreeNode * node = nodes[i];
if (node->left != NULL) {
nextLevelNodes.push_back(node->left);
}
if (node->right != NULL) {
nextLevelNodes.push_back(node->right);
}
}
if (!nextLevelNodes.empty()) {
doJob(nextLevelNodes, res);
}
vector<int> * r = new vector<int>();
for (int i = 0; i < nodes.size(); i++) {
TreeNode * node = nodes[i];
r->push_back(node->val);
}
res.push_back(*r);
}
vector<vector<int> > levelOrderBottom(TreeNode *root) {
vector<vector<int> > res;
if (root == NULL) {
return res;
}
vector<TreeNode *> rootLevel;
rootLevel.push_back(root);
doJob(rootLevel, res);
return res;
}
};
}