Lecture 9 Random built Binary Search Trees BSTs

Random built Binary Search Trees  BSTs   

E[hight] near 3logn

Quick Sort?

Relation to Quick Sort:

BST sort & Quick sort make same comparisons but in a different order.

Randomized BST Sort:

1. Randomly permute A

2. BST sort(A)