Tree Sort   Given a N random number, we can sort the numbers as follows. Starting with a empty binary search tree T, insert each of N numbers into T in any order. This step will time O(___A___) ___A___ = [选择] N between NlogN and N^2 between N and N logN N^2 between logN and N logN Perform a in-oder traversal of T, and then print then out in an ascending (sorted) order. This step will time O(___B___) ___B___ =  [选择] N logN logN N^2 N   Given N numbers in the descending order, the tree sort will take  O(___C___) time. ___C___ = [选择] N N^2 logN N logN In the best case, the tree sort will take O(___D___) time ___D___ = [选择] logN N^2 N logN N 1Multiple dropdown selections