AVL Tree Dictionary Data Structure
4
12
10
6
2
11
5
8
14
13
7
9
Binary search tree properties
binary tree property
search tree property
Balance property
balance of every node is:
-1?? b ? 1
result:
depth is ?(log n)
15
Previous slide
Next slide
Back to first slide
View graphic version