1.44k likes | 1.68k Views
In this chapter, you will:Learn about linked listsBecome aware of the basic properties of linked listsExplore the insertion and deletion operations on linked listsDiscover how to build and manipulate a linked listLearn how to construct a doubly linked list. Storing and processing data in an ar
E N D
1. CHAPTER 17LINKED LISTS
2. In this chapter, you will:
Learn about linked lists
Become aware of the basic properties of linked lists
Explore the insertion and deletion operations on linked lists
Discover how to build and manipulate a linked list
Learn how to construct a doubly linked list
3.
Storing and processing data in an array has limitations.
Array size is fixed. So only a fixed number of items can be stored in an array.
Searching for an item in an array is time consuming if data is not sorted.
If data is sorted, item insertion and deletion becomes time consuming.
4. LINKED LISTS A linked list is a collection of components, called nodes. Every node (except the last node) contains the address of the next node. Every node in a linked list has two components. The address of the first node of the list is stored in a separate location, called head or first.