binary search tree delete problem

[shamslam845]

I copied this code out of the book for deleting a node and it doesn't seem to work. The only part that works is when the node to be deleted has 2 children. Does anyone know what the problem is?

void bSearchTreeType<elemType>::deleteFromTree
(nodeType<elemType>* &p)
{
nodeType<elemType> *current; //pointer to traverse the tree
nodeType<elemType> *trailCurrent; //pointer behind current
nodeType<elemType> *temp; //pointer to delete the node
if (p == NULL)
cout << "Error: The node to be deleted is NULL."
<< endl;
else if (p->lLink == NULL && p->rLink == NULL)
{
temp = p;
p = NULL;
delete temp;
}
else if (p->lLink == NULL)
{
temp = p;
p = temp->rLink;
delete temp;
}
else if (p->rLink == NULL)
{
temp = p;
p = temp->lLink;
delete temp;
}

if p is the right node to q, then does setting p = NULL work the same as setting q->right = NULL?

I feel like that is where the problem is.

[viliml]

If you think you know where the problem is, then try to fix it that way! Otherwise say: I have no idea how to solve this!