LeetCode/solutions/cpp/0117.cpp at master · SnistAheads/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/*
// 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) {
        Node* node = root;
        Node* curr = new Node(NULL);
        Node* prev = curr;

        while (node) {
            while (node) {
                curr->next = node->left;
                if (curr->next) curr = curr->next;
                curr->next = node->right;
                if (curr->next) curr = curr->next;
                node = node->next;
            }
            node = prev->next;
            curr = prev;
        }

        return root;
    }
};