doubly linked list - sellout/data-structure-zoo GitHub Wiki
The downside of a doubly linked list as a data structure is that it stores two additional pointers with each node, tripling the in-memory size vs a competing data structure like a dynamic array.
-
[[chop back]]
– O(1) -
[[chop front]]
– O(1) -
[[peek back]]
– O(1) -
[[peek front]]
– O(1) -
[[push back]]
– O(1) -
[[push front]]
– O(1)