<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
an	O
(	O
a	O
,	O
b	O
)	O
tree	O
is	O
a	O
kind	O
of	O
balanced	O
search	B-Data_Structure
tree	I-Data_Structure
.	O
</s>
<s>
An	O
(	O
a	O
,	O
b	O
)	O
-tree	O
has	O
all	O
of	O
its	O
leaves	B-Data_Structure
at	O
the	O
same	O
depth	O
,	O
and	O
all	O
internal	O
nodes	B-Data_Structure
except	O
for	O
the	O
root	O
have	O
between	O
and	O
children	B-Data_Structure
,	O
where	O
and	O
are	O
integers	O
such	O
that	O
.	O
</s>
<s>
The	O
root	O
has	O
,	O
if	O
it	O
is	O
not	O
a	O
leaf	O
,	O
between	O
2	O
and	O
children	B-Data_Structure
.	O
</s>
<s>
Every	O
inner	O
node	O
except	O
the	O
root	O
has	O
at	O
least	O
and	O
at	O
most	O
children	B-Data_Structure
.	O
</s>
<s>
The	O
root	O
has	O
at	O
most	O
children	B-Data_Structure
.	O
</s>
<s>
All	O
paths	O
from	O
the	O
root	O
to	O
the	O
leaves	B-Data_Structure
are	O
of	O
the	O
same	O
length	O
.	O
</s>
<s>
Let	O
be	O
the	O
number	O
of	O
child	B-Data_Structure
nodes	I-Data_Structure
of	O
node	O
.	O
</s>
<s>
Let	O
be	O
pointers	O
to	O
child	B-Data_Structure
nodes	I-Data_Structure
.	O
</s>
