Relative List Operations
For a relative ordered list, what are the
operations?     (the same!)
insert, retrieve, remove, create, destroy, display
insert, retrieve, and remove would all require the client
program to supply a position number
instead we insert at a relative position, retrieve the data
at that position, remove data at a given position --- this
time affecting the rest of the list!
A remove at position 1 would require every other piece
of data to shift down (logically)