# Leetcode 116. Populating Next Right Pointers in Each Node

## 2. Solution

• Version 1
/**
* Definition for binary tree with next pointer.
*  int val;
*  TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
* };
*/
class Solution {
public:
if(!root) {
return;
}
q1.push(root);
while(!q1.empty()) {
current = q1.front();
q1.pop();
if(current->left && current->right) {
q2.push(current->left);
q2.push(current->right);
}
if(pre) {
pre->next = current;
}
pre = current;
if(q1.empty()) {
pre->next = nullptr;
pre = nullptr;
q1 = q2;
q2 = {};
}
}
}
};

• Version 2
/**
* Definition for binary tree with next pointer.
*  int val;
*  TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
* };
*/
class Solution {
public:
if(!root) {
return;
}
q.push(root);
connect(q);
}

private:
while(!q.empty()) {
current = q.front();
q.pop();
if(current->left && current->right) {
q2.push(current->left);
q2.push(current->right);
}
if(pre) {
pre->next = current;
}
pre = current;
}
pre->next = nullptr;
if(!q2.empty()) {
connect(q2);
}
}
};

• Version 3
/**
* Definition for binary tree with next pointer.
*  int val;
*  TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
* };
*/
class Solution {
public:
if(!root) {
return;
}
while(root) {
while(current && current->left) {
current->left->next = current->right;
if(current->next) {
current->right->next = current->next->left;
}
current = current->next;
}
root = root->left;
}
}
};