Sorting with BSTs

• Since run time is proportional to the number of comparisons, same time as quicksort: O(n lg n)

• Which do you think is better, quicksort or BSTsort? Why?

Previous slide

Next slide

Back to first slide

View graphic version