- References
In computer science, a 2–3 heap is a data structure, a variation on the heap, designed by Tadao Takaoka in 1999. The structure is similar to the Fibonacci heap, and borrows from the 2–3 tree.
Time costs for some common heap operations are:
- Delete-min takes
amortized time. - Decrease-key takes constant amortized time.
- Insertion takes constant amortized time.
References
- Tadao Takaoka. Theory of 2–3 Heaps, Cocoon (1999).
1 : Heaps (data structures)
- Oreopholus ruficollis
- Oreophryne
- Oreophryne albopunctata
- Oreophryne alticola
- Oreophryne anthonyi
- Oreophryne anulata
- Oreophryne asplenicola
- Oreophryne atrigularis
- Oreophryne biroi
- Oreophryne brachypus
- Oreophryne brevicrus
- Oreophryne brevirostris
- Oreophryne celebensis
- Oreophryne clamata
- Oreophryne crucifer
- Oreophryne flava
- Oreophryne frontifasciata
- Oreophryne geislerorum
- Oreophryne geminus
- Oreophryne habbemensis
- Oreophryne hypsiops
- Oreophryne idenburgensis
- Oreophryne inornata
- Oreophryne insulana
- Oreophryne jeffersoniana