Populating Next Right Pointer in Each Node | C++ | Easy to Understand
\nclass Solution {\n\npublic:\n    Node* connect(Node* root) {\n        if(root == NULL || root->left == NULL) return root;\n        \n        \n        if(root
```\nclass Solution {\n\npublic:\n    Node* connect(Node* root) {\n        if(root == NULL || root->left == NULL) return root;\n        \n        \n        if(root->next != NULL){\n            root->right->next=root->next->left;\n        }\n        \n        root->left->next = root->right;\n        \n        connect(root->left);\n        connect(root->right);\n        \n        return root;\n    }\n};\n```
['Recursion', 'C']