Doubly Linked List Algorithms

Delete the head node of a doubly linked list in O(1).

Delete the tail node of a doubly linked list in O(1).

Insert a node at the head of a doubly linked list in O(1).

Append a node at the tail of a doubly linked list in O(1).

Reverse doubly linked list by swapping prev and next pointers in place.

Forward and backward traversal across doubly linked nodes.