No CrossRef data available.
Article contents
On constructing 2-3 trees
Published online by Cambridge University Press: 26 October 2018
Abstract
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.
- Type
- Functional Pearl
- Information
- Copyright
- © Cambridge University Press 2018
Discussions
No Discussions have been published for this article.