Functional Pearl: A fresh look at binary search trees
Binary search trees are old hat, aren't they? Search trees are routinely covered in introductory computer science classes and they are widely used in functional programming courses to illustrate the benefits of algebraic data types and pattern matching. And indeed, the operation of insertion en...
Autor principal: | Hinze, R |
---|---|
Formato: | Journal article |
Publicado em: |
2002
|
Registros relacionados
-
Functional Pearl: The Bird Tree
por: Hinze, R
Publicado em: (2009) -
Functional Pearl: Purely Functional 1−2 Brother Trees
por: Hinze, R
Publicado em: (2009) -
Functional Pearl: Perfect trees and bit−reversal permutations
por: Hinze, R
Publicado em: (2000) -
Functional Pearl: Weaving a Web
por: Hinze, R
Publicado em: (2001) -
Functional Pearl: Explaining binomial heaps
por: Hinze, R
Publicado em: (1999)