A doubly-linked-list is a computer science data structure consisting of nodes.
On CLRS's textbook "Introduction to Algorithm", there's such paragraph on pg. 258. We can delete an element in O(1) time if …