finger tree

(computing theory) A purely functional tree-like data structure offering amortized constant time access to its "fingers" (leaves), used for the efficient implementation of other purely functional data structures.