Problem
1. Write an algorithm that deletes a node from a binary search tree considering all possible cases. Analyze your algorithm and show the results using order notation.
2. Write an algorithm that creates a 3-2 tree from a list of keys. Analyze your algorithm and show the results using order notation.
3. Write an algorithm that lists all the keys in a 3-2 tree in their natural order. Analyze your algorithm and show the results using order notation.