<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
a	O
skew	B-Application
binomial	I-Application
heap	I-Application
(	O
or	O
skew	O
binomial	B-Application
queue	I-Application
)	O
is	O
a	O
variant	O
of	O
the	O
binomial	B-Application
heap	I-Application
that	O
supports	O
constant-time	O
insertion	O
operations	O
in	O
the	O
worst	O
case	O
,	O
rather	O
than	O
the	O
logarithmic	O
worst	O
case	O
and	O
constant	O
amortized	O
time	O
of	O
the	O
original	O
binomial	B-Application
heap	I-Application
.	O
</s>
<s>
Just	O
as	O
binomial	B-Application
heaps	I-Application
are	O
based	O
on	O
the	O
binary	O
number	O
system	O
,	O
skew	O
binary	O
heaps	O
are	O
based	O
on	O
the	O
skew	B-Application
binary	I-Application
number	I-Application
system	I-Application
.	O
</s>
