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...
Main Author: | Hinze, R |
---|---|
Format: | Journal article |
Published: |
2002
|
Similar Items
-
Functional Pearl: The Bird Tree
by: Hinze, R
Published: (2009) -
Functional Pearl: Purely Functional 1−2 Brother Trees
by: Hinze, R
Published: (2009) -
Functional Pearl: Perfect trees and bit−reversal permutations
by: Hinze, R
Published: (2000) -
Functional Pearl: Weaving a Web
by: Hinze, R
Published: (2001) -
Functional Pearl: Explaining binomial heaps
by: Hinze, R
Published: (1999)