Problem
1. In twenty words or less, explain how treesort works.
2. What is the relationship between treesort and quicksort?
3. What causes removal from a search tree to be more difficult than insertion into a search tree.
4. When is the algorithm for building a binary search tree developed and why is it preferable to simply using the function for inserting an item into a search tree for each item in the input?