For this problem, we will practice our pseudocoding skills and walk through the process of coming up with a pseudocode solution. When we approach a problem with prototypes or pseudocodes, we are able ...

Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST. Basically, the deletion can be divided into ...