Relative Ordered Lists
A relative ordered list
may not have holes
which means if the first data inserted is at position 12, it
would actually be inserted at the first position!
may “shift” data if inserted at the same position (another
insert at position 1 would shift what had been at position
1 -- now to be at position 2)
similar to “editors” such as vi