Priority Queues Based on Braun Trees (Q7361345)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Priority_Queue_Braun
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Priority Queues Based on Braun Trees |
AFP entry Priority_Queue_Braun |
Statements
4 September 2014
0 references
Tobias Nipkow
0 references
Priority Queues Based on Braun Trees (English)
0 references
This entry verifies priority queues based on Braun trees. Insertion and deletion take logarithmic time and preserve the balanced nature of Braun trees. Two implementations of deletion are provided.
0 references
