August 2019
Beginner to intermediate
798 pages
17h 2m
English
Doubly linked lists are more versatile than singly linked lists because you can traverse them in any direction you want and also you can insert and delete elements from them more easily. Additionally, even if you lose the pointer to the head of a doubly linked list, you can still find the head node of that list. However, this versatility comes at a price: maintaining two pointers for each node. It is up to the developer to decide whether that extra complexity is justified or not. After all, your music player might be using a doubly linked list to represent your current list of songs and be able to go to the previous song as well as the next one.
Read now
Unlock full access