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...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Author Ragde, Prabhakar
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 16.12.2014
Subjects
Binary system
Computer Science - Data Structures and Algorithms
Computer Science - Programming Languages
Deletion
Trees
Online AccessGet full text
ISSN2331-8422
DOI10.48550/arxiv.1412.4882

Cover

More Information
Summary: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 (with justification and analysis not previously available in the literature) for a purely-functional implementation based on AA trees, which is the simplest treatment of the subject of which I am aware.
Bibliography:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.1412.4882