-
Notifications
You must be signed in to change notification settings - Fork 0
/
Bheem Wants Ladoos.cpp
64 lines (63 loc) · 1.91 KB
/
Bheem Wants Ladoos.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
56
57
58
59
60
61
62
63
64
class Solution{
public:
Node* findTarget(Node* root, int home){
queue<Node*> q;
q.push(root);
while(!q.empty()){
Node* curr = q.front();
q.pop();
if(curr->data == home) return curr;
if(curr->left) q.push(curr->left);
if(curr->right) q.push(curr->right);
}
}
void markParents(Node* root, unordered_map<Node*, Node*> &parents, Node* target, int home){
queue<Node*> q;
q.push(root);
while(!q.empty()){
Node* curr = q.front();
q.pop();
if(curr->left){
parents[curr->left] = curr;
q.push(curr->left);
}
if(curr->right){
parents[curr->right] = curr;
q.push(curr->right);
}
}
}
int ladoos(Node* root, int home, int k){
int sol = 0;
unordered_map<Node*, Node*> parent;
Node* target = findTarget(root, home);
markParents(root, parent, target, home);
unordered_map<Node*, bool> vis;
queue<Node*> q;
q.push(target);
vis[target] = true;
int level = 0;
while(!q.empty()){
int n = q.size();
if(level++ > k) break;
for(int i = 0; i < n; i++){
Node* curr = q.front();
q.pop();
sol += curr->data;
if(curr->left && !vis[curr->left]){
q.push(curr->left);
vis[curr->left] = true;
}
if(curr->right && !vis[curr->right]){
q.push(curr->right);
vis[curr->right] = true;
}
if(parent[curr] && !vis[parent[curr]]){
q.push(parent[curr]);
vis[parent[curr]] = true;
}
}
}
return sol;
}
};