Reverse a doubly linked list
In this post, we will see how to reverse a doubly linked list using iteration and recursion.
Category: Linked List
Pairwise swap adjacent nodes of a linked list
Given a linked list, pairwise swap its adjacent nodes. The swapping of data is not allowed, only links should be changed.
Flatten a Linked List
Given a linked list that can grow in both horizontal and vertical directions (right and down), flatten it into a sorted singly linked list provided that each horizontal and vertical list is already sorted.
Check if a linked list of strings is palindromic
Given a linked list of strings, check whether the concatenation of all values in the list together forms a palindrome. It is not permissible to construct a string out of the linked list nodes and check that string for palindrome.
Flatten a multilevel linked list
Given a list that can grow in both horizontal and vertical directions (right and down), flatten it into a singly linked list. The conversion should be in such a way that the down node should be processed before the next node for any node.
Swap k’th node from beginning with k’th node from the end in a linked list
Given a linked list, swap the k’th node from the beginning with the k’th node from the end. The swapping should be done so that only links between the nodes are exchanged, and no data is swapped.
Print nodes of a binary tree in vertical order
Given a binary tree, print its nodes in vertical order. Assume that the left and right child of a node makes a 45–degree angle with the parent.
Link nodes present in each level of a binary tree in the form of a linked list
Given a binary tree, write an efficient algorithm to link nodes at the same level in the form of a linked list like structure.
Convert a multilevel linked list to a singly linked list
Given a multilevel linked list, convert it into a singly linked list so that all nodes of the first level appear first, followed by all nodes of the second level, and so on.
Linked List Implementation in Python
This post provides an overview of several methods to implement a linked list in Python.. A Linked List node consists of a data field and a reference to the next node in the list.
Rearrange a linked list by separating odd nodes from even ones
Given a linked list, rearrange it by separating odd nodes from even ones. All even nodes should come before all odd nodes in the output list, and the relative order of even and odd nodes should be maintained.
In-place merge two sorted linked lists without modifying links of the first list
Given two sorted linked lists, merge them without using extra space without modifying links of the first list. The solution should preserve the sorted order of elements in both lists.