A linked list whose nodes store predecessor and successor references satisfying reciprocal-link consistency. A known node can be unlinked in constant pointer work without searching for its predecessor. The representation uses extra references and requires both directions to be updated on insertion and deletion.
Keep the physical doubly linked list unchanged and represent the logical sequence in either forward or backward order according to a Boolean flag. Toggling the flag reverses the logical contents in constant time complexity. Endpoint insertion and indexed access must interpret their positions using the flag, and the abstraction function explicitly accounts for this choice.
Articles by others on the same topic
There are currently no matching articles.