Definitions from Wikipedia (Brodal queue)

▸ noun:  In computer science, the Brodal queue is a heap/priority queue structure with very low worst case time bounds: for insertion, find-minimum, meld (merge two queues) and decrease-key and for delete-minimum and general deletion.


▸ Words similar to brodal queue
▸ Usage examples for brodal queue

▸ Idioms related to brodal queue
▸ Wikipedia articles (New!)
▸ Words that often appear near brodal queue
▸ Rhymes of brodal queue

▸ Invented words related to brodal queue