Given a linked list where every node represents a linked list and contains two pointers of its type:
- Pointer to next node in the main list (we call it ‘right’ pointer in the code below).
- Pointer to a linked list where this node is headed (we call it the ‘down’ pointer in the code below).
All linked lists are sorted. See the following example
5 -> 10 -> 19 -> 28
| | | |
V V V V
7 20 22 35
| | |
V V V
8 50 40
| |
V V
30 45
Write a function flatten() to flatten the lists into a single linked list. The flattened linked list should also be sorted. For example, for the above input list, output list should be 5->7->8->10->19->20->22->28->30->35->40->45->50.
The idea is to use the Merge() process of merge sort for linked lists. We use merge() to merge lists one by one. We recursively merge() the current list with the already flattened list.
The down pointer is used to link nodes of the flattened list.
Below is the implementation of the above approach:
C++
// C++ program for flattening a // Linked List #include <bits/stdc++.h> using namespace std; // Link list node class Node { public: int data; Node *right, *down; }; Node* head = NULL; // An utility function to merge // two sorted linked lists Node* merge(Node* a, Node* b) { // If first linked list is empty // then second is the answer if (a == NULL) return b; // If second linked list is empty // then first is the result if (b == NULL) return a; // Compare the data members of the // two linked lists and put the larger // one in the result Node* result; if (a->data < b->data) { result = a; result->down = merge(a->down, b); } else { result = b; result->down = merge(a, b->down); } result->right = NULL; return result; } Node* flatten(Node* root) { // Base Cases if (root == NULL || root->right == NULL) return root; // Recur for list on right root->right = flatten(root->right); // Now merge root = merge(root, root->right); // Return the root // It will be in turn merged // with its left return root; } // Utility function to insert a node at // beginning of the linked list Node* push(Node* head_ref, int data) { // Allocate the Node & // Put in the data Node* new_node = new Node(); new_node->data = data; new_node->right = NULL; // Make next of new Node as head new_node->down = head_ref; // Move the head to point to // new Node head_ref = new_node; return head_ref; } void printList() { Node* temp = head; while (temp != NULL) { cout << temp->data << " "; temp = temp->down; } cout << endl; } // Driver code int main() { /* Create the following linked list 5 -> 10 -> 19 -> 28 | | | | V V V V 7 20 22 35 | | | V V V 8 50 40 | | V V 30 45 */ head = push(head, 30); head = push(head, 8); head = push(head, 7); head = push(head, 5); head->right = push(head->right, 20); head->right = push(head->right, 10); head->right->right = push(head->right->right, 50); head->right->right = push(head->right->right, 22); head->right->right = push(head->right->right, 19); head->right->right->right = push(head->right->right->right, 45); head->right->right->right = push(head->right->right->right, 40); head->right->right->right = push(head->right->right->right, 35); head->right->right->right = push(head->right->right->right, 20); // Flatten the list head = flatten(head); printList(); return 0; } // This code is contributed by rajsanghavi9. |
Output:
5 7 8 10 19 20 20 22 30 35 40 45 50
Time Complexity: O(N*N*M) – where N is the no of nodes in main linked list (reachable using right pointer) and M is the no of node in a single sub linked list (reachable using down pointer).
Space Complexity: O(N*M) as the recursive functions will use recursive stack of size equivalent to total number of elements in the lists.
Please refer complete article on Flattening a Linked List for more details!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!