( Using C++ ) Write a function to Recursively remove the inorder successor of the smallest data item from a Binary Search Tree.

assuming:

int remove_smallest_ios(node * root); or int remove_smallest_ios(node * & root);

and:

struct node

{

int data;

node * left;

node * right;

};