Search Operation

• For successful search, average number of comparisons:

sum of all (path length+1) / number of nodes

• For the binary search tree (of airports) it is:

39/11 = 3.55

• For the AVL tree (of airports) it is :

33/11 = 3.0

Previous slide

Next slide

Back to first slide

View graphic version