Welcome To Tutorialspoint.dev
Officially launched 18th May 2019

# Remove duplicates from an unsorted doubly linked list

Given an unsorted doubly linked list containing n nodes. The problem is to remove duplicate nodes from the given list. Examples: Recommended: Please try your appro...

# Remove duplicates from a sorted doubly linked list

Given a sorted doubly linked list containing n nodes. The problem is to remove duplicate nodes from the given list. Examples: Recommended: Please try your approach...

# Sort a k sorted doubly linked list

Given a doubly linked list containing n nodes, where each node is at most k away from its target position in the list. The problem is to sort the given doubly linked ...

# Sort the biotonic doubly linked list

Sort the given biotonic doubly linked list. A biotonic doubly linked list is a doubly linked list which is first increasing and then decreasing. A strictly increasing...

# Convert a given Binary Tree to Doubly Linked List Set 4

Given a Binary Tree (BT), convert it to a Doubly Linked List(DLL) In-Place. The left and right pointers in nodes are to be used as previous and next pointers respecti...

# Delete all occurrences of a given key in a doubly linked list

Given a doubly linked list and a key x. The problem is to delete all occurrences of the given key x from the doubly linked list. Examples: Recommended: Please try ...

# Sorted insert in a doubly linked list with head and tail pointers

A Doubly linked list is a linked list that consists of a set of sequentially linked records called nodes. Each node contains two fields that are references to the pre...

# Rotate Doubly linked list by N nodes

Given a doubly linked list, rotate the linked list counter-clockwise by N nodes. Here N is a given positive integer and is smaller than the count of nodes in linked l...

# Skip List Set 1 (Introduction)

Can we search in a sorted linked list in better than O(n) time? The worst case search time for a sorted linked list is O(n) as we can only linearly traverse the list ...