Journal article icon

Journal article

Functional Pearl: Purely Functional 1−2 Brother Trees

Abstract:

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, which deserves to be better known. Brother trees lend themselves well to a functional implementation with deletion as straightforward as insertion, both running in logarithmic time. Furthermore, brother tr...

Expand abstract

Actions


Access Document


Publisher copy:
10.1017/S0956796809007333

Authors


Journal:
JFP
Volume:
19
Issue:
6
Pages:
633-644
Publication date:
2009-01-01
DOI:
URN:
uuid:2b0b53c7-b08a-4d41-899e-c2b0b1827b4c
Local pid:
cs:3977

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP