-
Notifications
You must be signed in to change notification settings - Fork 0
/
623-add-one-row-to-tree.cpp
49 lines (49 loc) · 1.62 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
/**
* 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:
TreeNode* addOneRow(TreeNode* root, int val, int depth) {
if(depth==1){ // base case (root case)
TreeNode* oldRoot = root;
root= new TreeNode(val, oldRoot, nullptr);
}
queue<TreeNode*> q;
q.push(root);
TreeNode* cur;
int d=1, ct=1; // depth & count of nodes in each level
while(!q.empty()){
if(d==depth-1){ // after parents of required depth found
while(!q.empty()){ // Loop ==> can be made into a different fx altogether
cur = q.front();
if(cur){
TreeNode* lt=cur->left;
TreeNode* rt=cur->right;
cur->left= new TreeNode(val, lt, nullptr);
cur->right= new TreeNode(val, nullptr, rt);
}
q.pop();
}
return root;
}
// Usual loop until parents of reqd depth has not been reached
cur = q.front();
if(cur){
q.push(cur->left);
q.push(cur->right);
}
q.pop();
if(!(--ct))
ct=q.size(), d++;
}
return root;
}
};