Consider the Tree Sort algorithm in which sorting is achieved by placing all elements to be sorted into a binary search tree and then taking the in-order traversal of the tree. AVL Tree Sort places all elements into an AVL binary search tree and then takes the in-order traversal of the tree. Which of the following statements are true about these sorts? A. Tree Sort and AVL Tree Sort both perform well on input that is already in nearly sorted order. B. The best case time complexity of Tree Sort is O(n log n) C. The worst case time complexity of AVL Tree Sort is ?(n). D. The best case space complexity of Tree Sort is 0(n) E. The best case space complexity of AVL Tree Sort is?

a  social news website  is an  internet  website  that features  user-posted stories. such stories are ranked based on popularity, as voted on by other users of the site or by website administrators. users typically comment online on the news posts and these comments may also be ranked in popularity. since their emergence with the birth of  web 2.0, social news sites have been used to link many types of information, including news, humor, support, and discussion. all such websites allow the users to submit content and each site differs in how the content is moderated. on the  slashdot  and  fark  websites,  administrators  decide which articles are selected for the front page. on  reddit  and  digg, the articles that get the most votes from the community of users will make it to the front page. many social news websites also feature an online comment system, where users discuss the issues raised in an article. some of these sites have also applied their voting system to the comments, so that the most popular comments are displayed first. some social news websites also have a  social networking  function, in that users can set up a user profile and follow other users' online activity on the website.