FOR TREE SORT, EACH INSERTION TAKES LOGARITHMIC TIME AT MOST, SO FOR n INSERTIONS worstTime( n ) IS O( n log n ). THEREFORE averageTime( n ) IS O( n log n ).
1 of 5