Doubly Linked Lists (DLL)

Explore how doubly linked lists improve over singly linked lists by enabling bi-directional traversal. Understand node structure, insertion and deletion processes, and their impact on time complexity to enhance your coding interview skills.

We'll cover the following...

Introduction
Structure of the Doubly Linked List (DLL)
- Impact on Deletion
Time Complexity

Introduction #

By now, you must have noticed a constraint that arises when dealing with singly-linked lists. For any function which does not operate at the head node, we must traverse the whole list in a loop.

While the search operation in a normal list works in the same way, access is much faster as lists allow indexing.

Furthermore, since a linked list can only be traversed in one direction, we needlessly have to keep track of previous elements.

This is where the doubly linked list comes to the rescue! ...

1.Introduction to Complexity Measures

2.Introduction to Arrays

3.Introduction to Linked Lists

4.Introduction to Stack/Queues

5.Introduction to Graphs

6.Introduction to Trees

7.Trie

8.Introduction to Heap

9.Introduction to Hashing

10.Summary of Data Structures

Mock Interview

Doubly Linked Lists (DLL)

Introduction #