Linked list: linked lists tend not to do very well with accessing and sorting numbers
Array: fast accessing, but sorting is expensive
Binary tree: binary trees do failry well with ordering.
Heap: a heap is reallt good at basic ordering nad keeping track of max and mins.
Array: fast accessing, but sorting is expensive
Binary tree: binary trees do failry well with ordering.
Heap: a heap is reallt good at basic ordering nad keeping track of max and mins.
