-
Notifications
You must be signed in to change notification settings - Fork 0
/
116-populating-next-right-pointers-in-each-node.cpp
53 lines (49 loc) · 1.5 KB
/
116-populating-next-right-pointers-in-each-node.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
/*
// Definition for a Node.
class Node {
public:
int val;
Node* left;
Node* right;
Node* next;
Node() : val(0), left(NULL), right(NULL), next(NULL) {}
Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}
Node(int _val, Node* _left, Node* _right, Node* _next)
: val(_val), left(_left), right(_right), next(_next) {}
};
*/
class Solution {
public:
vector<queue <Node*>> v; // Vector of Queues
bool firstTime = true; // Meme reference : https://knowyourmeme.com/memes/james-franco-first-time
Node* connect(Node* root, int lvl=0) {
// Execute in first run only
if (firstTime){
if (!(root))
return root;
// Constructing empty queues for every level in tree
auto ptr = root;
while(ptr->left){
v.push_back(queue<Node*>());
ptr = ptr->left;
}
firstTime = false;
}
auto rootsLeft = root->left;
auto rootsRight = root->right;
if (rootsLeft){
rootsLeft->next = rootsRight;
if (!(v[lvl].empty())){// leftmost nodes are not the next of any node
(v[lvl].front())->next = rootsLeft;
v[lvl].pop();
}
connect(rootsLeft, lvl+1);
}
if (rootsRight){
// next of tree's right-most border remains null
v[lvl].push(rootsRight);
connect(rootsRight, lvl+1);
}
return root;
}
};