思路:由于是完全二叉树,所以若节点的左子结点存在的话,其右子节点必定存在,所以左子结点的next指针可以直接指向其右子节点,对于其右子节点的处理方法是,判断其父节点的next是否为空,若不为空,则指向其next指针指向的节点的左子结点,若为空则指向NULL
/*
// Definition for a Node.
class Node {
public:
int val;
Node* left;
Node* right;
Node* next;
Node() {}
Node(int _val, Node* _left, Node* _right, Node* _next) {
val = _val;
left = _left;
right = _right;
next = _next;
}
};
*/
class Solution {
public:
Node* connect(Node* root) {
helper(root);
return root;
}
void helper(Node*root)
{
if(!root) return ;
if(root->left) root->left->next=root->right;
if(root->right) root->right->next=root->next?root->next->left:NULL;
if(root->left) helper(root->left);
if(root->right) helper(root->right);
}
};