Constructing red-black trees (1999) [8 citations — 3 self]
by Ralf Hinze
In Proceedings of Workshop on Algorithmic Aspects of Advanced Programming Languages
http://www.informatik.uni-bonn.de/~ralf/RedBlackTree2.ps.gz
Add To MetaCart
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
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
