Simple Balanced Binary Search Trees

Efficient implementations of sets and maps (dictionaries) are important in computer science, and balanced binary search trees are the basis of the best practical implementations. Pedagogically, however, they are often quite complicated, especially with respect to deletion. I present complete code (w...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2014-12
1. Verfasser:	Ragde, Prabhakar
Format:	Artikel
Sprache:	eng
Schlagworte:	Binary system Computer Science - Data Structures and Algorithms Computer Science - Programming Languages Deletion Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!