Flatten a Multilevel Doubly Linked List Solution(Java) - The Coding Shala
Home >> Interview Questions >> Flatten a Multilevel Doubly Linked List
Flatten a Multilevel Doubly Linked List Solution
In this post, you will learn how to flatten a multilevel doubly linked list in Java.
You are given a doubly linked list which in addition to the next and previous pointers, it could have a child pointer, which may or may not point to a separate doubly linked list. These child lists may have one or more children of their own, and so on, to produce a multilevel data structure, as shown in the example below. Flatten the list so that all the nodes appear in a single-level, doubly linked list. You are given the head of the first level of the list.
Flatten a multilevel doubly linked list Java solution
We can do this using recursion. Whenever the child is not empty, traverse using the child node and do linking next, prev and make child node as null.
Other Posts You May Like
- Detect Cycle in a Linked List
- Find the first node of a cycle in a linked list
- The Intersection of two linked lists
- Reverse a linked lists
- Rotate a Linked list