Link List
3 likes287 views
The document discusses linked lists, highlighting their structure, advantages, and disadvantages. It explains the operations associated with linked lists, such as insertion and deletion, and compares their efficiency to other data structures. Additionally, it touches on the concept of double-ended lists and stack implementation using linked lists.
Link List
- 1. Data Structures and Algorithms By Budditha Hettige 1
- 2. Link List second most commonly used general purpose storage structures after arrays 2
- 3. Link List • Each data item is embedded in a link. • Each Link object contains a reference (usually called next) to the next link in the list 3
- 4. Advantages • Dynamic data Structure . • Can grow and shrink during run time. • Insertion and Deletion Operations are Easier • Efficient Memory Utilization ,i.e no need to pre-allocate memory • Faster Access time,can be expanded in constant time without memory overhead 4
- 5. Disadvantages • Wastage of Memory • No Random Access • Access time for Individual Element is O(n) • Reverse Traversing is difficult • Heap Space Restriction 5
- 6. Link List • A link Node 6 NextdData iData (key)
- 9. Link List class • Class with Link Node 9 Link List
- 11. Is Empty 11
- 16. Display List 16
- 17. Example 17
- 18. Find Items 18
- 19. Delete Item 19
- 20. Delete Item 20
- 21. Double-Ended Lists • similar to an ordinary linked list • It has one additional feature: a reference to the last link 21
- 22. Linked-List Efficiency • Insertion and deletion at the beginning of a linked list are very fast. • They involve changing only one or two references, which takes O(1) time. • Finding, deleting, or inserting next to a specific item requires searching, Which takes O(N) 22
- 23. A Stack Implemented by a Linked List • We can use a linked list to hold a stack’s data • push() -theList.insertFirst(data) • pop() - data = theList.deleteFirst() 23