e/Fingertree

Information
has gloss	eng: A finger tree is a purely functional data structure used in efficiently implementing other functional data structures. A finger tree gives amortized constant time access to the "fingers" (leaves) of the tree, where data is stored, and the internal nodes are labeled in some way as to provide the functionality of the particular data structure being implemented. For example, a priority queue can be implemented by labeling the internal nodes by the minimum priority of its children in the tree, or an indexed list/array can be implemented with a labeling of nodes by the count of the leaves in their children. Finger trees can provide amortized O(1) cons, reversing, cdr, O(log n) append and split; and can be adapted to be indexed or ordered sequences.
lexicalization	eng: finger tree
lexicalization	eng: Fingertree
instance of	e/Tree (data structure)