Lec6 mod linked list
•Download as PPT, PDF•
0 likes•498 views
The document discusses linked lists and their implementation. It defines linked lists as lists where nodes are linked together by pointers rather than being stored in contiguous memory locations. Dynamic linked lists use nodes allocated dynamically on the heap. The key operations for linked lists are traversing the list by following node pointers, inserting nodes at the front or elsewhere by allocating new nodes and updating pointers, and deleting nodes by updating pointers and deallocating nodes. Sorted lists maintain the nodes in sorted order according to some comparison criterion.
![Topics ,[object Object],[object Object],[object Object],[object Object],[object Object]](https://image.slidesharecdn.com/lec6mod-linkedlist-101225021805-phpapp02/85/Lec6-mod-linked-list-1-320.jpg)
![To implement the List ADT ,[object Object],[object Object],[object Object]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
More Related Content
What's hot
Similar to Lec6 mod linked list
Similar to Lec6 mod linked list (20)
Recently uploaded
Recently uploaded (20)
Lec6 mod linked list
- 6. Array-based class List Reset IsFull Length IsPresent Delete IsEmpty Insert GetNexItem Private data: length data [ 0] [1] [2] [MAX_LENGTH-1] currentPos SelSort
- 9. Implementation Possibilities for a List List Linked list Built-in array Built-in dynamic data and pointers Built-in array of structs
- 14. Pointer Dereferencing and Member Selection ‘ A’ 6000 ptr . info . link ptr ptr . info . link ‘ A’ 6000 *ptr ptr . info . link (*ptr).info ptr->info ‘ A’ 6000
- 15. ptr is a pointer to a node ‘ A’ 6000 ptr . info . link ptr
- 16. *ptr is the entire node pointed to by ptr . info . link ‘ A’ 6000 *ptr ptr
- 17. ptr->info is a node member ptr->info (*ptr).info // Equivalent ‘ A’ 6000 ptr . info . link
- 18. ptr->link is a node member ptr->link (*ptr).link // Equivalent ‘ A’ 6000 ptr . info . link
- 19. Traversing a Dynamic Linked List // Pre: head points to a dynamic linked list ptr = head; while (ptr != NULL) { cout << ptr->info; // Or, do something else with node *ptr ptr = ptr->link; } ptr 3000 “Ted” 5000 “Irv” 2000 “Lee” NULL 3000 5000 2000 head
- 20. Traversing a Dynamic Linked List // Pre: head points to a dynamic linked list ptr = head; while (ptr != NULL) { cout << ptr->info; // Or, do something else with node *ptr ptr = ptr->link; } ptr 3000 3000 “Ted” 5000 “Irv” 2000 “Lee” NULL 3000 5000 2000 head
- 21. Traversing a Dynamic Linked List // Pre: head points to a dynamic linked list ptr = head; while (ptr != NULL) { cout << ptr->info; // Or, do something else with node *ptr ptr = ptr->link; } ptr 3000 3000 “Ted” 5000 “Irv” 2000 “Lee” NULL 3000 5000 2000 head
- 22. Traversing a Dynamic Linked List // Pre: head points to a dynamic linked list ptr = head; while (ptr != NULL) { cout << ptr->info; // Or, do something else with node *ptr ptr = ptr->link; } ptr 3000 3000 “Ted” 5000 “Irv” 2000 “Lee” NULL 3000 5000 2000 head
- 23. Traversing a Dynamic Linked List // Pre: head points to a dynamic linked list ptr = head; while (ptr != NULL) { cout << ptr->info; // Or, do something else with node *ptr ptr = ptr->link; } ptr 5000 3000 “Ted” 5000 “Irv” 2000 “Lee” NULL 3000 5000 2000 head
- 24. Traversing a Dynamic Linked List // Pre: head points to a dynamic linked list ptr = head; while (ptr != NULL) { cout << ptr->info; // Or, do something else with node *ptr ptr = ptr->link; } ptr 5000 3000 “Ted” 5000 “Irv” 2000 “Lee” NULL 3000 5000 2000 head
- 25. Traversing a Dynamic Linked List // Pre: head points to a dynamic linked list ptr = head; while (ptr != NULL) { cout << ptr->info; // Or, do something else with node *ptr ptr = ptr->link; } ptr 5000 3000 “Ted” 5000 “Irv” 2000 “Lee” NULL 3000 5000 2000 head
- 26. Traversing a Dynamic Linked List // Pre: head points to a dynamic linked list ptr = head; while (ptr != NULL) { cout << ptr->info; // Or, do something else with node *ptr ptr = ptr->link; } ptr 2000 3000 “Ted” 5000 “Irv” 2000 “Lee” NULL 3000 5000 2000 head
- 27. Traversing a Dynamic Linked List // Pre: head points to a dynamic linked list ptr = head; while (ptr != NULL) { cout << ptr->info; // Or, do something else with node *ptr ptr = ptr->link; } ptr 2000 3000 “Ted” 5000 “Irv” 2000 “Lee” NULL 3000 5000 2000 head
- 28. Traversing a Dynamic Linked List // Pre: head points to a dynamic linked list ptr = head; while (ptr != NULL) { cout << ptr->info; // Or, do something else with node *ptr ptr = ptr->link; } ptr 2000 3000 “Ted” 5000 “Irv” 2000 “Lee” NULL 3000 5000 2000 head
- 29. Traversing a Dynamic Linked List // Pre: head points to a dynamic linked list ptr = head; while (ptr != NULL) { cout << ptr->info; // Or, do something else with node *ptr ptr = ptr->link; } ptr NULL 3000 “Ted” 5000 “Irv” 2000 “Lee” NULL 3000 5000 2000 head
- 30. Traversing a Dynamic Linked List // Pre: head points to a dynamic linked list ptr = head; while (ptr != NULL) { cout << ptr->info; // Or, do something else with node *ptr ptr = ptr->link; } ptr NULL 3000 “Ted” 5000 “Irv” 2000 “Lee” NULL 3000 5000 2000 head