Argue that inserting n keys into a BST is (n log n).

12.1-5 Argue that since sorting n elements takes (n lgn) time in the worst case in the comparison model, any comparison-based algorithm for constructing a binary search tree from an arbitrary list of n elements takes (n lg n) time in the worst case 12.1-5 Argue that since sorting n elements takes (n lgn) time in the worst case in the comparison model, any comparison-based algorithm for constructing a binary search tree from an arbitrary list of n elements takes (n lg n) time in the worst case