In computer science, the Brodal queue is a heap/priority queue structure with very low worst case time bounds: O {\displaystyle O} for insertion, find-minimum, meld and decrease-key and O {\displaystyle O} for delete-minimum and general deletion. Wikipedia