File:Tfpie2014 submission 8.pdf

From tfpie
Tfpie2014_submission_8.pdf(file size: 312 KB, MIME type: application/pdf)

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.

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeDimensionsUserComment
current14:23, 20 May 2014 (312 KB)Peter88 (talk | contribs)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 re
  • You cannot overwrite this file.

There are no pages that link to this file.