<s>
An	O
exponential	B-Data_Structure
tree	I-Data_Structure
is	O
a	O
type	O
of	O
search	B-Data_Structure
tree	I-Data_Structure
where	O
the	O
number	O
of	O
children	O
of	O
its	O
nodes	O
decreases	O
doubly-exponentially	O
with	O
increasing	O
depth	O
.	O
</s>
<s>
Exponential	B-Data_Structure
trees	I-Data_Structure
use	O
another	O
data	O
structure	O
in	O
inner	O
nodes	O
containing	O
the	O
splitters	O
from	O
children	O
,	O
allowing	O
fast	O
lookup	O
.	O
</s>
<s>
Exponential	B-Data_Structure
trees	I-Data_Structure
achieve	O
optimal	O
asymptotic	O
complexity	O
on	O
some	O
operations	O
.	O
</s>
<s>
An	O
exponential	B-Data_Structure
tree	I-Data_Structure
is	O
a	O
rooted	O
tree	O
where	O
every	O
node	O
contains	O
a	O
splitter	O
and	O
every	O
leaf	O
node	O
contains	O
a	O
value	O
.	O
</s>
<s>
An	O
exponential	B-Data_Structure
tree	I-Data_Structure
with	O
values	O
is	O
defined	O
recursively	O
:	O
</s>
<s>
A	O
Fusion	B-Data_Structure
tree	I-Data_Structure
can	O
be	O
used	O
as	O
this	O
data	O
structure	O
.	O
</s>
<s>
The	O
exponential	B-Data_Structure
tree	I-Data_Structure
can	O
be	O
searched	O
in	O
the	O
same	O
way	O
as	O
a	O
normal	O
search	B-Data_Structure
tree	I-Data_Structure
.	O
</s>
