Fichas
Linked list
Fichas del conjunto (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
Información
- Descripción
- M269 Fichas sobre Linked list, creado por alan.hickmott el 18/05/2014.
- Creado por
- alan.hickmott
- Visitas
- 21
- Valoración