CiteSeerX — Constructing Red-Black Trees

Constructing Red-Black Trees (1999) [9 citations — 3 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Hinze99constructingred-black,
    author = {Ralf Hinze},
    title = {Constructing Red-Black Trees},
    booktitle = {In Proceedings of Workshop on Algorithmic Aspects of Advanced Programming Languages},
    year = {1999},
    pages = {89--99}
}

Years of Citing Articles

Bookmarks

OpenURL

Abstract:

This paper explores the structure of red-black trees by solving an apparently simple problem: given an ascending sequence of elements, construct, in linear time, a red-black tree that contains the elements in symmetric order. Several extreme red-black tree shapes are characterized: trees of minimum and maximum height, trees with a minimal and with a maximal proportion of red nodes. These characterizations are obtained by relating tree shapes to various number systems. In addition, connections to left-complete trees, AVL trees, and half-balanced trees are highlighted. 1 Introduction Red-black trees are an elegant search-tree scheme that guarantees O(log n) worst-case running time of basic dynamic-set operations. Recently, C. Okasaki [10, 11] presented a beautiful functional implementation of red-black trees. In this paper we plunge deeper into the structure of red-black trees by solving an apparently simple problem: given an ascending sequence of elements, construct a red-black tree th...

Citations

503	The Art of Computer Programming, Volume 3: Sorting and Searching – Knuth - 1998
156	Purely functional data structures – Okasaki - 1998
134	An algorithm for the organization of information – Adel'son-Vel'skii, Landis - 1962
90	Symmetric binary b-trees: Data structure and maintenance algorithms – Bayer - 1972
41	A new representation of linear lists – Guibas, McCreight, et al. - 1977
26	An algorithm for the organization of information. Doklady Akademii Nauk SSSR – Adelson-Velskii, Landis - 1962
25	Data Structures, Algorithms, and Performance – Wood - 1993
15	Functional Algorithm Design – Bird - 1995
14	A new class of balanced search trees: Half-balanced binary search – Olivie - 1982
8	Functional Pearls: Efficient sets---a balancing act – Adams - 1993
7	A characterization of heaps and its applications – Sack, Strothotte - 1990
5	Functional Pearls: On building trees with minimum height – Bird - 1997
5	Functional Pearl: Explaining binomial heaps – Hinze - 1999
4	Functional Pearl: Red-Black trees in a functional setting – Okasaki - 1999
2	A new representation for linear lists. Pages 49--60 of: Conference record of the ninth annual ACM symposium on theory of computing – Guibas, McCreight, et al. - 1977
2	Functional algorithm design. Science of Computer Programming 26 – Bird - 1996
1	Functional Pearls: E cient sets\|a balancing act – Adams - 1993
1	Functional algorithm design. Science ofcomputer programming – Bird - 1996