Please enable JavaScript.
Coggle requires JavaScript to display documents.
Lists - Coggle Diagram
Lists
Linked List Implementation
dynamic memory allocation
(doesn't need max size)
nodes
element : stores
element value
singly linked list - one-way list
next : stores
pointer to next node
list of nodes connected through pointers
remove, insert, append :
tail : O(1)
head : O(1)
freelists
useful for constant grow-and-shrink lists
prevents 'delete' and 'new' calls
enforces homogeinity
ADT - Abstract Data Type
Finite
Ordered (Each element has a position - index)
head
tail
basic methods
clear
append
remove
move (to beggining, end, previous, next)
lenght
get value
find
insert
Array-Based Implementation
size must be known from creation
should have a max size
remove, insert, append :
tail : 0(1)
head : O(n)
Adjacent memory units
Sorted/Unsorted
