Flashcards
Linked list
Cards in this deck (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
Information
- Description
- M269 Flashcards on Linked list, created by alan.hickmott on 18/05/2014.
- Created by
- alan.hickmott
- Views
- 21
- Rating