<s>
In	O
an	O
array	B-Data_Structure
,	O
moving	O
all	O
items	O
to	O
the	O
next	O
lower	O
location	O
.	O
</s>
<s>
In	O
machine	B-Language
code	I-Language
(	O
and	O
assembly	B-Language
language	I-Language
)	O
moving	O
all	O
bits	O
in	O
a	O
register	O
to	O
the	O
left	O
,	O
with	O
the	O
leftmost	O
(	O
most	O
significant	O
bit	O
)	O
becoming	O
the	O
rightmost	O
.	O
</s>
<s>
In	O
a	O
binary	B-Language
search	I-Language
tree	I-Language
,	O
a	O
left	B-Data_Structure
rotation	I-Data_Structure
is	O
the	O
movement	O
of	O
a	O
node	O
,	O
X	O
,	O
down	O
to	O
the	O
left	O
.	O
</s>
<s>
Left	B-Data_Structure
rotations	I-Data_Structure
(	O
and	O
right	O
)	O
are	O
order	O
preserving	O
in	O
a	O
binary	B-Language
search	I-Language
tree	I-Language
;	O
it	O
preserves	O
the	O
binary	B-Language
search	I-Language
tree	I-Language
property	O
(	O
an	O
in-order	O
traversal	O
of	O
the	O
tree	O
will	O
yield	O
the	O
keys	O
of	O
the	O
nodes	O
in	O
proper	O
order	O
)	O
.	O
</s>
<s>
AVL	O
trees	O
and	O
red	O
–	O
black	O
trees	O
are	O
two	O
examples	O
of	O
binary	B-Language
search	I-Language
trees	I-Language
that	O
use	O
the	O
left	B-Data_Structure
rotation	I-Data_Structure
.	O
</s>
<s>
A	O
single	O
left	B-Data_Structure
rotation	I-Data_Structure
is	O
done	O
in	O
O(1 )	O
time	O
but	O
is	O
often	O
integrated	O
within	O
the	O
node	O
insertion	O
and	O
deletion	O
of	O
binary	B-Language
search	I-Language
trees	I-Language
.	O
</s>
