Problem: As we study Singly Linked Lists (SLL) and Doubly Linked Lists (DLL) this week, we know that the main difference between the two is that SLL are one way and DLL are two way. SLL only have a forward pointer to the next node and DLL have a pointer to the next node and a pointer to the previous node.
One research article goes deep into studying DLL and reorganization strategies to optimize search time (Valiveti & Oommen, 1993). The two strategies are Move-to-End (MTE) and SWAP. This article discusses this approach to optimizing the use of DLL. It is well worth the read for those who want to delve deeper into this topic. The reference is below along with the internet link to the article.
Please advise perspective on this information.
Reference:
Valiveti, R. S., & Oommen, B. J. (1993). Self-organizing doubly-linked lists. Journal of Algorithms, 14(1), 88-114.