Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
16Activity
0 of .
Results for:
No results containing your search query
P. 1
AVL TREE LECTURE

AVL TREE LECTURE

Ratings:

3.0

(2)
|Views: 2,064|Likes:
Published by Karen Nguyen

More info:

Published by: Karen Nguyen on Sep 07, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PPT, PDF, TXT or read online from Scribd
See more
See less

12/16/2014

pdf

text

original

 
AVL Trees
CSE, POSTECH
 
Balanc
ed
Bina
ry Se
a
ch
Trees
If 
the height o
a binary tree is always O(log n), wecan guarantee O(log n) per 
ormance
or eachsearch tree operation
Trees with aworst-case height o
O(log n)arecalled
b
alanc
ed trees
A
n example o
a balanced tree is
AVL
(
A
delson-
V
elsky and
L
andis) tree
 
AVL Tree
Def 
ini
t
ion
B
inary tree.
If 
T is a nonempty binary tree with T
L
and T
R
asits le
t and right subtrees, then T is an
 AV
L tree i
ff 
1
.
T
L
and T
R
are
 AV
L trees, and
2.
|
h
L
 ±
h
R
|
 
e
1
where h
L
and h
R
are the heights o
T
L
andT
R
, respectively

Activity (16)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
Janice Loza liked this
Tran Duc Nhan liked this
Stephen Cook liked this
Jeong Min Lee liked this
Jeong Min Lee liked this
Sundaram Mishra liked this
Hanan Sharaf liked this
Alia Malek liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->