I've been trying to implement a delete function for a Binary Search Tree but haven't been able to get it to work in all cases.

This is my latest attempt:

if(t->get_left() == empty)
 *t = *t->get_left();
else if(t->get_right() == empty)
 *t = *t->get_right();
else if((t->get_left() != empty) && (t->get_right() != empty))
{
 Node* node = new Node(t->get_data(), t->get_parent(), t->get_colour(), t->get_left(), t->get_right());
 *t = *node;
}

t is a node and empty is just a node with nothing in it.

I'm just trying to swap the values but I'm getting a runtime error. Any ideas?

Thanks