<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
the	O
Brodal	B-Application
queue	I-Application
is	O
a	O
heap/priority	O
queue	O
structure	O
with	O
very	O
low	O
worst	B-General_Concept
case	I-General_Concept
time	O
bounds	O
:	O
for	O
insertion	O
,	O
find-minimum	O
,	O
meld	O
(	O
merge	O
two	O
queues	O
)	O
and	O
decrease-key	O
and	O
for	O
delete-minimum	O
and	O
general	O
deletion	O
.	O
</s>
<s>
They	O
are	O
the	O
first	O
heap	B-Application
variant	O
to	O
achieve	O
these	O
bounds	O
without	O
resorting	O
to	O
amortization	O
of	O
operational	O
costs	O
.	O
</s>
<s>
Brodal	B-Application
queues	I-Application
are	O
named	O
after	O
their	O
inventor	O
Gerth	O
Stølting	O
Brodal	O
.	O
</s>
<s>
While	O
having	O
better	O
asymptotic	O
bounds	O
than	O
other	O
priority	B-Application
queue	I-Application
structures	O
,	O
they	O
are	O
,	O
in	O
the	O
words	O
of	O
Brodal	O
himself	O
,	O
"	O
quite	O
complicated	O
"	O
and	O
"[not]	O
applicable	O
in	O
practice.	O
"	O
</s>
<s>
Brodal	O
and	O
Okasaki	O
describe	O
a	O
persistent	B-Application
(	O
purely	B-Application
functional	I-Application
)	O
version	O
of	O
Brodal	B-Application
queues	I-Application
.	O
</s>
