Problem
1. What does a splay tree look like if its entries are accessed in increasing order by their keys?
2. Explain how to use an AVL tree or a red-black tree to sort n comparable elements in O(nlogn) time in the worst case.
3. Can we use a splay tree to sort n comparable elements in O(nlogn) time in the worst case? Why or why not?