1a.
findMin
  Return first element in array.
deleteMin
  Remove first element in the array and move all other elements to fill the hole.
insert
  Resize if more space needed. Add e to array.
  Move new element downwards (e.g swapping) until elements are in sorted order.

1b.
findMin
  Find smallest element in array and return it.
deleteMin
  Find smallest element in array and remove it.
  Move elements at later indices to fill the hole.
insert(e)
  Resize if space needed. Add e to array.

1c.
findMin
  Return the left-most element in the tree.
deleteMin
  Remove the left-most element in the tree.
insert
  Insert element into the binary search tree.


Amortized worst-case costs:
            A      B      C (balanced)   C (unbalanced)
findMin     O(1)   O(N)   O(log N)       O(N)
deleteMin   O(N)   O(N)   O(log N)       O(N)
insert      O(N)   O(1)   O(log N)       O(N)