class Solution {
public:
void connect(TreeLinkNode *root) {
if(root==NULL) return ;
TreeLinkNode *start = root;
TreeLinkNode *cur = start;
while(start){
cur = start;
while(cur && cur->left){
cur->left->next = cur->right;
if(cur->next) cur->right->next = cur->next->left;
cur = cur->next;
}
start = start->left;
}
return ;
}
};
public:
void connect(TreeLinkNode *root) {
if(root==NULL) return ;
TreeLinkNode *start = root;
TreeLinkNode *cur = start;
while(start){
cur = start;
while(cur && cur->left){
cur->left->next = cur->right;
if(cur->next) cur->right->next = cur->next->left;
cur = cur->next;
}
start = start->left;
}
return ;
}
};