<s>
A	O
beap	B-Application
,	O
or	O
bi-parental	B-Application
heap	I-Application
,	O
is	O
a	O
data	B-General_Concept
structure	I-General_Concept
where	O
a	O
node	O
usually	O
has	O
two	O
parents	O
(	O
unless	O
it	O
is	O
the	O
first	O
or	O
last	O
on	O
a	O
level	O
)	O
and	O
two	O
children	O
(	O
unless	O
it	O
is	O
on	O
the	O
last	O
level	O
)	O
.	O
</s>
<s>
Unlike	O
a	O
heap	B-Application
,	O
a	O
beap	B-Application
allows	O
sublinear	O
search	O
.	O
</s>
<s>
The	O
beap	B-Application
was	O
introduced	O
by	O
Ian	O
Munro	O
and	O
Hendra	O
Suwanda	O
.	O
</s>
<s>
A	O
related	O
data	B-General_Concept
structure	I-General_Concept
is	O
the	O
Young	O
tableau	O
.	O
</s>
<s>
Find	O
operations	O
in	O
the	O
heap	B-Application
can	O
be	O
in	O
the	O
worst	O
case	O
.	O
</s>
<s>
Removal	O
and	O
insertion	O
of	O
new	O
elements	O
involves	O
propagation	O
of	O
elements	O
up	O
or	O
down	O
(	O
much	O
like	O
in	O
a	O
heap	B-Application
)	O
in	O
order	O
to	O
restore	O
the	O
beap	B-Application
invariant	O
.	O
</s>
<s>
An	O
additional	O
perk	O
is	O
that	O
beap	B-Application
provides	O
constant	O
time	O
access	O
to	O
the	O
smallest	O
element	O
and	O
time	O
for	O
the	O
maximum	O
element	O
.	O
</s>
<s>
You	O
would	O
start	O
at	O
the	O
absolute	O
bottom-most	O
element	O
of	O
the	O
top	O
node	O
(	O
similar	O
to	O
the	O
left-most	O
child	O
in	O
a	O
heap	B-Application
)	O
and	O
move	O
either	O
up	O
or	O
right	O
to	O
find	O
the	O
element	O
of	O
interest	O
.	O
</s>
