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...

ver descrição completa

Detalhes bibliográficos
Autor principal: Hinze, R
Formato: Journal article
Publicado em: 2009