Abstract
The singly linked list structure is a useful data structure for storing and accessing dynamic lists. Unfortunately, the singly linked structure has its shortcomings, as only a list can be accessed in one direction—forward. Once a member of a list is located, it is not easy to access its previous neighbor. In such a case, using a singly linked list is extremely difficult. This chapter discusses other data structures, including an alternative to the singly linked list—the doubly linked list. A powerful general purpose list package is developed to support a dynamic pop-up menu system. Turbo C is an excellent language for constructing general purpose tools, and the list package that is developed provides a few techniques and tips for constructing useful tools. The doubly linked lists can be constructed by modifying the singly linked list construction tools. The doubly linked list is an extension of the singly linked list.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
