C++ | [99%, 100% memory] | 5-liner | Recursively crispy AF
\nclass Solution {\npublic:\n    Node* connect(Node* root) {\n        if(root and root->left) {\n            root->left->next = root->right;\n            auto c
```\nclass Solution {\npublic:\n    Node* connect(Node* root) {\n        if(root and root->left) {\n            root->left->next = root->right;\n            auto c1 = root->left, c2 = root->right;\n            while(c1->right) c1->right->next = c2->left, c1 = c1->right, c2 = c2->left;\n            root->left = connect(root->left), root->right = connect(root->right);\n        }\n        return root;\n    }\n};\n```\n\nExplanation -\n1. Traverse tree\n2. Make given connections\n3. ???\n4. Profit!
[]