Swipe to navigate through the chapters of this book
Unlike stacks that have one access point at the top where an item can be pushed or popped and queues which can only have items enqueued at the rear or dequeued from the front, a list can have items inserted or deleted from the front, rear, or anywhere in between. In this chapter arrays are used to implement ordered lists. The insert and delete methods in addition to the search method are discussed. In the complete program recursion is used to print strings stored in the list.