AlgoViz: Interactive Algorithm Visualization Tool

Doubly Linked List

Category: Data Structures | Time: O(n) Search | Space: O(n)

Input Data

Visualization

Visual representation of the data structure

Enter commands to build the doubly linked list.

About Doubly Linked List

A Doubly Linked List is a type of linked list where each node contains a data field and two pointers: one to the next node in the sequence (next pointer) and one to the previous node (prev pointer). This bidirectional linking allows for traversal in both directions.

Code Editor

The code is for reference. Editing it won't affect the visualization.

class Node {
    constructor(data) {
        this.data = data;
        this.next = null;
        this.prev = null;
    }
}
class DoublyLinkedList {
    constructor() {
        this.head = null;
        this.tail = null;
    }
    // ... insert, delete methods ...
    insertAtEnd(data) {
      const newNode = new Node(data);
      if (!this.head) {
          this.head = newNode;
          this.tail = newNode;
          return;
      }
      this.tail.next = newNode;
      newNode.prev = this.tail;
      this.tail = newNode;
    }
}

What is a Doubly Linked List?

What are the advantages of a Doubly Linked List over a Singly Linked List?

What are the disadvantages?

What does a node in a Doubly Linked List contain?

How does deletion work in a Doubly Linked List?

What are the time complexities for operations?

Where are Doubly Linked Lists used?

Where can I learn more?