Currently, when the insertion is performed repeatedly at the end of the sequence, most of processing time is consumed by the getIndex function.
Todo:
The current function aims to start from the closer bound of the array in the inspected LSEQNode (beginning or the end). But it should consider that all its children have an equal number of children themselves. First, fix this dumb mistake...
Then, search if there are structures to get quick access to elements in the tree. i.e. some kind of reversed index logarithmically growing.
Currently, when the insertion is performed repeatedly at the end of the sequence, most of processing time is consumed by the getIndex function.
Todo: