4 a. Outline an algorithm for deleting a key from a binary search tree. *Should be written in pseudocode

b. What is the time efficiency class of your algorithm?

Hints: a. Consider separately three cases: (1) the keys node is a leaf; (2) the keys node has one child; (3) the keys node has two children.

b. Assume that you know a location of the key to be deleted.