You have n int values that are currently in a random order. You will insert them one at a time into an initially empty BST that will be sorted from largest to smallest. What is the average case time complexity to do this? Explain. Expert Answer Anonymous answered this 703 answers Was this answer helpful? Bo There will be two operation in this. 1) first we have to find the location at which elements has to be placed. 2) insert all the n elements. Now the complexity to find the location is O(logn) Now we have to insert n such elements so overall complexity is O(nlogn). Here n is the number of elements