Write a C++ function to delete the given value from the binary search tree. The function takes two arguments, tree node and value of the node to be deleted. Also replace the node to be deleted with the minimum of its right subtree when the node has two children.

The struct - >

struct TreeNode

{

int key;

TreeNode *left;

TreeNode *right;

TreeNode *parent;

};

For example:

If the node to be deleted is 30, delete it and replace it with the minimum of its right subtree. Final tree:

The Function header should be ->

void deleteAndReplaceMinRight(TreeNode *root, int key){