Add C++ implementation

Signed-off-by: begeekmyfriend <[email protected]>

Author: begeekmyfriend

0116_populating_next_right_pointers_in_each_node/connect.c

@@ -1,33 +1,35 @@
 #include <stdio.h>
 #include <stdlib.h>
 
-struct TreeLinkNode {
+
+struct Node {
     int val;
-    struct TreeLinkNode *left;
-    struct TreeLinkNode *right;
-    struct TreeLinkNode *next;
+    struct Node *left;
+    struct Node *right;
+    struct Node *next;
 };
 
-static void connect(struct TreeLinkNode *root)
+struct Node* connect(struct Node *root)
 {
     if (root == NULL) {
-        return;
+        return root;
     }
 
-    struct TreeLinkNode *head = root;
+    struct Node *head = root;
     while (head->left != NULL) {
-        struct TreeLinkNode *p;
+        struct Node *p;
         for (p = head; p != NULL; p = p->next) {
             p->left->next = p->right;
             p->right->next = p->next == NULL ? NULL : p->next->left;
         }
         head = head->left;
     }
+    return root;
 }
 
 int main(int argc, char **argv)
 {
-    struct TreeLinkNode root, n1[2], n2[4], n3[8];
+    struct Node root, n1[2], n2[4], n3[8];
     root.val = 5;
     n1[0].val = 4;
     n1[1].val = 8;

0116_populating_next_right_pointers_in_each_node/connect.cc

@@ -0,0 +1,41 @@
+#include <stdc++.h>
+
+using namespace std;
+
+/*
+// 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 == nullptr) {
+            return root;
+        }
+
+        if (root->left != nullptr) {
+            root->left->next = root->right;
+        }
+        Node *next = root->next;
+        if (root->right != nullptr && next != nullptr) {
+            root->right->next = next->left;
+        }
+        connect(root->left);
+        connect(root->right);
+        return root;
+    }
+};