Revision history of "File:Tfpie2014 submission 8.pdf"

Jump to navigation Jump to search

Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

  • curprev 14:23, 20 May 2014‎ Peter88 talk contribs‎ 500 bytes +500‎ 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
Retrieved from "https://wiki.tfpie.science.ru.nl/File:Tfpie2014_submission_8.pdf"