Populating Next Right Pointers in Each Node

Author: piyush6348

Populating Next Right Pointers in Each Node.cpp

@@ -0,0 +1,26 @@
+/**
+ * Definition for binary tree with next pointer.
+ * struct TreeLinkNode {
+ *  int val;
+ *  TreeLinkNode *left, *right, *next;
+ *  TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    void connect(TreeLinkNode *root) {
+        
+        if(root==NULL)
+            return;
+        
+        if(root->left!=NULL)
+            root->left->next=root->right;
+        
+        if(root->next!=NULL && root->right!=NULL)
+            root->right->next=root->next->left;
+        
+        connect(root->left);
+        connect(root->right);
+        
+    }
+};