Finger trees: a simple general−purpose data structure

We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in time logarithmic in the size of the smaller piece. Representations achieving these bounds have appeared previously, but 2-3...

Descrizione completa

Dettagli Bibliografici
Autori principali: Hinze, R, Paterson, R
Natura: Journal article
Pubblicazione: 2006

Documenti analoghi