Doubly Linked List
Linear data structure with bidirectional traversal.
A doubly linked list is a linear data structure where each element contains a value and two pointers: one pointing to the next element in sequence, and another pointing to the previous element. This allows traversal in both directions, unlike singly linked lists.
Built by Tim Jones