Doubly Linked List
Nodes linked in both directions — traverse backward, and delete in O(1) once you're holding a reference.
Coming soon
I'm still writing "Doubly Linked List". Check back soon — it'll be worth the wait.
Nodes linked in both directions — traverse backward, and delete in O(1) once you're holding a reference.
I'm still writing "Doubly Linked List". Check back soon — it'll be worth the wait.