<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
dynamization	B-Data_Structure
is	O
the	O
process	O
of	O
transforming	O
a	O
static	O
data	O
structure	O
into	O
a	O
dynamic	O
one	O
.	O
</s>
<s>
Although	O
static	O
data	O
structures	O
may	O
provide	O
very	O
good	O
functionality	O
and	O
fast	O
queries	O
,	O
their	O
utility	O
is	O
limited	O
because	O
of	O
their	O
inability	O
to	O
grow/shrink	O
quickly	O
,	O
thus	O
making	O
them	O
inapplicable	O
for	O
the	O
solution	O
of	O
dynamic	B-General_Concept
problems	I-General_Concept
,	O
where	O
the	O
input	O
data	O
changes	O
.	O
</s>
<s>
Dynamization	B-Data_Structure
techniques	O
provide	O
uniform	O
ways	O
of	O
creating	O
dynamic	B-Data_Structure
data	I-Data_Structure
structures	I-Data_Structure
.	O
</s>
<s>
Decomposition	B-Algorithm
is	O
a	O
term	O
used	O
in	O
computer	B-General_Concept
science	I-General_Concept
to	O
break	O
static	O
data	O
structures	O
into	O
smaller	O
units	O
of	O
unequal	O
size	O
.	O
</s>
<s>
For	O
more	O
details	O
about	O
the	O
topic	O
see	O
Decomposition	B-Algorithm
(	O
computer	B-General_Concept
science	I-General_Concept
)	O
.	O
</s>
<s>
For	O
simplicity	O
,	O
binary	O
system	O
will	O
be	O
used	O
in	O
this	O
article	O
but	O
any	O
other	O
base	O
(	O
as	O
well	O
as	O
other	O
possibilities	O
such	O
as	O
Fibonacci	B-Algorithm
numbers	I-Algorithm
)	O
can	O
also	O
be	O
utilized	O
.	O
</s>
<s>
Operations	O
performed	O
on	O
the	O
new	O
dynamic	O
data	O
structure	O
may	O
involve	O
traversing	O
sets	O
formed	O
by	O
decomposition	B-Algorithm
.	O
</s>
