Corpus ID: 758171

Constructing Red−Black Trees

@inproceedings{Hinze1999ConstructingRT,
  title={Constructing Red−Black Trees},
  author={Ralf Hinze},
  year={1999}
}
  • Ralf Hinze
  • Published 1999
  • Computer Science
  • This paper explores the structure of red-black trees by solv ing an apparently simple problem: given an ascending sequence of elements, construct, in linear tim e, a red-black tree that contains the elements in symmetric order. Several extreme red-black tree shapes are ch acterized: 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… CONTINUE READING
    23 Citations

    Figures and Topics from this paper.

    Purely Functional 1-2 Brother Trees
    • 2
    • PDF
    On constructing 2-3 trees
    Efficient Verified Red-Black Trees
    • 18
    • PDF
    Red-black trees with types
    • S. Kahrs
    • Computer Science
    • J. Funct. Program.
    • 2001
    • 27
    Deletion: The curse of the red-black tree
    • 5
    • PDF
    More on balanced diets
    An Algebra of Scans
    • 25
    • PDF
    Associative-Commutative Rewriting on Large Terms
    • 41
    • PDF
    Manufacturing datatypes
    • 32
    • PDF

    References

    SHOWING 1-10 OF 28 REFERENCES
    On Building Trees with Minimum Height
    • R. Bird
    • Computer Science
    • J. Funct. Program.
    • 1997
    • 9
    FUNCTIONAL PEARL
    • R. Bird
    • Mathematics, Computer Science
    • 1997
    • 27
    A New Class of Balanced Search Trees: Half Balanced Binary Search Trees
    • H. Olivié
    • Computer Science
    • RAIRO Theor. Informatics Appl.
    • 1982
    • 58
    • PDF
    A Characterization of Heaps and Its Applications
    • 17
    A new representation for linear lists
    • 185
    Explaining Binomial Heaps
    • 6
    Data structures, algorithms, and performance
    • 71
    • PDF
    Purely functional data structures
    • 642
    • Highly Influential
    • PDF
    Functional Data Structures
    • 35
    A c haracterization of heaps and its applications. Information and computation
    • A c haracterization of heaps and its applications. Information and computation
    • 1990