Simple Balanced Binary Search Trees

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

Bibliographic Details
Main Author: Prabhakar Ragde
Format: Article
Language:English
Published: Open Publishing Association 2014-12-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1412.4882v1
id doaj-6e6599982a4c424b8b7e886fa9064179
record_format Article
spelling doaj-6e6599982a4c424b8b7e886fa90641792020-11-24T21:53:40ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802014-12-01170Proc. TFPIE 2014788710.4204/EPTCS.170.6:8Simple Balanced Binary Search TreesPrabhakar Ragde0 University of Waterloo, Waterloo, Ontario, Canada 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.http://arxiv.org/pdf/1412.4882v1
collection DOAJ
language English
format Article
sources DOAJ
author Prabhakar Ragde
spellingShingle Prabhakar Ragde
Simple Balanced Binary Search Trees
Electronic Proceedings in Theoretical Computer Science
author_facet Prabhakar Ragde
author_sort Prabhakar Ragde
title Simple Balanced Binary Search Trees
title_short Simple Balanced Binary Search Trees
title_full Simple Balanced Binary Search Trees
title_fullStr Simple Balanced Binary Search Trees
title_full_unstemmed Simple Balanced Binary Search Trees
title_sort simple balanced binary search trees
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2014-12-01
description 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.
url http://arxiv.org/pdf/1412.4882v1
work_keys_str_mv AT prabhakarragde simplebalancedbinarysearchtrees
_version_ 1725870735654649856

Similar Items