Functional Pearl: Purely Functional 1−2 Brother Trees
Enter the computing arboretum and you will find a variety of well-studied trees: AVL trees, symmetric binary B-trees, Hopcroft's 2-3 trees, the bushy finger trees, and the colourful red-black trees. In this pearl, we look at a more exotic species of balanced search trees, 1-2 brother trees, whi...
Main Author: | Hinze, R |
---|---|
Format: | Journal article |
Published: |
2009
|
Similar Items
-
Purely Functional 1-2 Brother Trees
by: Hinze, R
Published: (2009) -
Functional Pearl: The Bird Tree
by: Hinze, R
Published: (2009) -
Functional Pearl: Perfect trees and bit−reversal permutations
by: Hinze, R
Published: (2000) -
Functional Pearl: A fresh look at binary search trees
by: Hinze, R
Published: (2002) -
Functional Pearl: Weaving a Web
by: Hinze, R
Published: (2001)