Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- // 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:
- Node* connect(Node* root) {
- if(!root) return NULL;
- auto head = root;
- while(root){
- Node *tmpChild = new Node(0);
- Node *nextLevel = tmpChild;
- while(root){
- if(root->left) {tmpChild->next = root->left; tmpChild = tmpChild->next;}
- if(root->right) {tmpChild->next = root->right; tmpChild = tmpChild->next;}
- root = root->next;
- }
- root = nextLevel->next;
- }
- return head;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement