Next: Binomial Queues (binomial heaps)
Up: Höhere Datenstrukturen
Previous: Perfektes Hashing
Operationen:
Insert()
,
Delete()
,
DeleteMin()
,
FindMin()
,
DecreaseKey()
,
Merge()
Implementierungen:
- Binomial Queues
- Fibonacci Heaps
Abbas-Bardia Kabiri-Jarghouyeh
3/3/1999