Linked List in Data Structure PDF Summary
Dear readers, in this post we are going to upload the Linked List in Data Structure PDF to help you. A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. A linked list is a sequence of links that contain items. Each link contains a connection to another link. The Linked list is the second most used data structure after array. Following are important terms to understand the concepts of Linked List.
Linked List in Data Structure PDF – Types
- Simple Linked List − Item Navigation is forward only.
- Doubly Linked List − Items can be navigated forward and backward way.
- Circular Linked List − The last item contains a link of the first element as next and the first element has a link to the last element as prev.
- Insertion − Adds an element at the beginning of the list.
- Deletion − Deletes an element at the beginning of the list.
- Display − Displays the complete list.
- Search − Searches an element using the given key.
- Delete − Deletes an element using the given key.
Advantage of Linked List
- Dynamic Size
- It is easy to add/remove/change elements
- Elements of linked list are flexible, it can be primary data type or user defined data types
Disadvantage of Linked List
- Random access is not allowed. We have to access elements sequentially starting from the first node.
- So we cannot do binary search with linked lists 2. It cannot be easily sorted
- We must traverse 1/2 the list on average to access any element
- More complex to create than an array 5. Extra memory space for a pointer is required with each element of the list
Here you can download the Linked List in Data Structure PDF by click on the link given below.