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.

You only need to consider the case where the node has two children. The node should be replaced by the minimum node in its right subtree.

void deleteAndReplaceMinRight(TreeNode *root, int key); (just using this function) don't need other function

struct TreeNode {

int key;

TreeNode *left;

TreeNode *right;

TreeNode *parent;

};

For example:

 25 / \ 15 30 / \ 28 35 / \ / \ 27 29 33 70 

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

 25 / \ 15 33 / \ 28 35 / \ \ 27 29 70