1 The binary search tree operations can also be implemented iteratively. Design and implement an iterative solution for each operation: (a) search (b) _nd minimum (c) insert (d) delete 2 Design and...

1 The binary search tree operations can also be implemented iteratively. Design and implement an iterative solution for each operation:

(a) search (b) _nd minimum (c) insert (d) delete

2 Design and implement the function bstMaximum(), which _nds and returns the maximum key value in a binary search tree.

3 Implement the delete operation for the AVL and 2-3 trees.