-
Notifications
You must be signed in to change notification settings - Fork 1
/
623+Add One Row to Tree.cpp
55 lines (45 loc) · 1.36 KB
/
623+Add One Row to Tree.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
54
55
class Solution {
public:
TreeNode* addOneRow(TreeNode* root, int val, int depth) {
if (depth == 1) {
TreeNode* newN = new TreeNode(val);
newN->left = root;
return newN;
}
int nowd = 1;
queue<TreeNode*> q;
q.push(root);
vector<TreeNode*> wait;
while (q.size()) {
int size = q.size();
for (int i = 0; i < size; ++i) {
auto cur = q.front(); q.pop();
if (cur->left) q.push(cur->left);
if (cur->right) q.push(cur->right);
if (nowd == depth - 1) {
wait.emplace_back(cur);
}
}
nowd++;
}
for (auto &pa : wait) {
TreeNode* leftN = pa->left;
TreeNode* rightN = pa->right;
TreeNode* newN = new TreeNode(val);
if (leftN != nullptr) {
pa->left = newN;
newN->left = leftN;
} else {
pa->left = newN;
}
newN = new TreeNode(val);
if (rightN) {
pa->right = newN;
newN->right = rightN;
} else {
pa->right = newN;
}
}
return root;
}
};