Finishing the indexJ function that performs O(log n) lookups
Proving the indexJ function works as expected
WIP for making a dropJ that will drop the first n elements in O(log n) time
Additional WIP trying to make the dropJ for dropping first elements from a tree
Fixing the "right" side of drop