Karteikarten
Linked list
Karten in diesem Stapel (3)
- 1Linked ListSingle chain of nodes
Head Pointer
Tail pointer
Operations
Add
Remove
Find
Enumerat - 2RemoveRemove from front is less costly than removing from the end; as the operation will need to iterate over the entire list in order to set the second to last pointer to null
- 3Doubly Linked list
Informationen
- Beschreibung
- M269 Karteikarten am Linked list, erstellt von alan.hickmott am 18/05/2014.
- Erstellt von
- alan.hickmott
- Aufrufe
- 21
- Bewertung