Grokking Data Structures & Algorithms for Coding Interviews
Ask Author
Back to course home

0% completed

Vote For New Content
Operations on Doubly Linked List
On this page

A doubly linked list is a data structure where each node contains three parts:

  • Data (the stored value)
  • Next pointer (points to the next node)
  • Prev pointer (points to the previous node)

This bidirectional structure allows traversal in both forward and backward directions and simplifies some operations like deletion.

1. Traversal in a Doubly Linked List

Traversal in a doubly linked list means visiting each node in sequence. We can traverse in two ways:

  • Forward Traversal: Start from the head and follow the next pointers until reaching the end.

.....

.....

.....

Like the course? Get enrolled and start learning!

On this page