Problem:
Question 1- In a BST, where are the minimal and maximal elements?
Question 2- Demonstrate insertion of a given list of keys into a BST, hash table or a Heap.
Question 3- What is the "computational complexity" of the "find" operation in BSTs, i.e how much work has to be done? 20 operation to find?
Question 4- Why are the keys in a BST all of the same type?
Please provide description of your answers.