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 finger trees are much simpler, as are the operations on them. Further, by defining the split operation in a general form, we obtain a general purpose data structure that can serve as a sequence, priority queue, search tree, priority search queue and more.
Description
Finger trees: a simple general-purpose data structure | Journal of Functional Programming | Cambridge Core
%0 Journal Article
%1 Hinze:2006:Finger
%A Hinze, Ralf
%A Paterson, Ross
%B Journal of Functional Programming
%D 2006
%I Cambridge University Press
%K Collections Immutable Trees
%N 2
%P 197--217
%R 10.1017/S0956796805005769
%T Finger Trees: A Simple General-purpose Data Structure
%V 16
%X 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 finger trees are much simpler, as are the operations on them. Further, by defining the split operation in a general form, we obtain a general purpose data structure that can serve as a sequence, priority queue, search tree, priority search queue and more.
@article{Hinze:2006:Finger,
abstract = {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 finger trees are much simpler, as are the operations on them. Further, by defining the split operation in a general form, we obtain a general purpose data structure that can serve as a sequence, priority queue, search tree, priority search queue and more.},
added-at = {2018-03-06T10:46:21.000+0100},
author = {Hinze, Ralf and Paterson, Ross},
biburl = {https://www.bibsonomy.org/bibtex/2692e237fb5f74a525aa82bbedca66ad0/gron},
booktitle = {Journal of Functional Programming},
description = {Finger trees: a simple general-purpose data structure | Journal of Functional Programming | Cambridge Core},
doi = {10.1017/S0956796805005769},
interhash = {09633916a02482b401cf18485068b700},
intrahash = {692e237fb5f74a525aa82bbedca66ad0},
issn = {09567968},
keywords = {Collections Immutable Trees},
number = 2,
pages = {197--217},
publisher = {Cambridge University Press},
timestamp = {2018-03-06T10:47:03.000+0100},
title = {{Finger Trees: A Simple General-purpose Data Structure}},
volume = 16,
year = 2006
}