# Leetcode 117. Populating Next Right Pointers in Each Node II

## 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) {
q2.push(current->left);
}
if(current->right) {
q2.push(current->right);
}
if(pre) {
pre->next = current;
}
pre = current;
if(q1.empty()) {
q1 = q2;
q2 = {};
pre = nullptr;
}
}
}
};

• 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) {
q2.push(current->left);
}
if(current->right) {
q2.push(current->right);
}
if(pre) {
pre->next = current;
}
pre = current;
}
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) {
parent = root;
while(parent) {
if(parent->left && parent->right) {
current->next = parent->left;
current->next->next = parent->right;
current = parent->right;
}
else if(parent->left) {
current->next = parent->left;
current = parent->left;
}
else if(parent->right){
current->next = parent->right;
current = parent->right;
}
parent = parent->next;
}
current->next = nullptr;
}
}
};


SnailTyan

• 擅长领域：
• 深度学习
• PyTorch
• OCR
• Docker
• Caffe