Delete Code

void delete(Comparable key, Node *& root) {

Node *& handle(find(key, root));

Node * toDelete = handle;

if (handle != NULL) {

if (handle->left == NULL) { // Leaf or one child

handle = handle->right;

delete toDelete;

} else if (handle->right == NULL) { // One child

handle = handle->left;

delete toDelete;

} else { // Two child case

successor = succ(root);

handle->data = successor->data;

delete(successor->data, handle->right);

}