On constructing 2-3 trees

Reference. On constructing 2-3 trees

Ralf Hinze · JFP · 2018 · program-calculation · PDF · DOI · pldb

We consider the task of constructing 2-3 trees. Given a sequence of elements we seek to build a 2-3 tree–in linear time–that contains the elements in symmetric order. We discuss three approaches: top-down, bottom-up, and incremental. The incremental approach is more flexible than the other two in that it allows us to interleave the construction work with other operations, for example, queries.

Cite

Cite as @hinze-2018-on (helia, typst) · \cite{hinze-2018-on} (LaTeX)

BibTeX

bibtex · 1 line

@article{hinze-2018-on, title={On constructing 2-3 trees}, volume={28}, ISSN={1469-7653}, url={http://dx.doi.org/10.1017/s0956796818000187}, DOI={10.1017/s0956796818000187}, journal={Journal of Functional Programming}, publisher={Cambridge University Press (CUP)}, author={HINZE, RALF}, year={2018} }

hayagriva YAML (typst)

yaml · 14 lines

hinze-2018-on:
  type: article
  title: On constructing 2-3 trees
  author: HINZE, RALF
  date: 2018
  url: http://dx.doi.org/10.1017/s0956796818000187
  serial-number:
    doi: 10.1017/s0956796818000187
    issn: 1469-7653
  parent:
    type: periodical
    title: Journal of Functional Programming
    publisher: Cambridge University Press (CUP)
    volume: 28

Download: hinze-2018-on.bib · hinze-2018-on.yml

Cites 9 works (1 here)

With notes (1)

Finger trees: a simple general-purpose data structure hinze-2005-fingerJFP · 2006

PDF · DOI · pldb

External (8)

Constructing red-black trees (1999)
A Logarithmic Implementation of Flexible Arrays (1983)
The Design and Analysis of Computer Algorithms (1974)
10.1017/cbo9780511530104
10.1145/357153.357158
10.1017/s0956796897002876
10.1017/s095679680100404x
10.1017/s0956796809007333