mem leak/crash

[broot]

can anyone spot where the problem is in the code below? when i compile it, half the time it runs properly, half the time it crashes. thankyou

main.cpp

{
DLList<char> charTest;

charTest.pushFront('a');
charTest.pushFront('b');
charTest.pushFront('c');

cout << charTest.popBack() << endl;
cout << charTest.popBack() << endl;
cout << charTest.popBack() << endl;

charTest.pushFront('a');
charTest.pushFront('b');
charTest.pushFront('c');

cout << charTest.popFront() << endl;
cout << charTest.popFront() << endl;
cout << charTest.popFront() << endl;
}

DLList.h

    T popBack ()
    {
        T popped;

        if (head == NULL) //empty
        {
            popped = NULL;
        }
        else if (tail == head) //1 node
        {
            popped = tail->getData();
            delete tail;
            delete head;
            tail = head = NULL;
        }
        else //more than 1 node
        {
            popped = tail->getData();
            DLNode<T>* tempTail = tail->getPrev();
            tempTail->setNext(NULL);
            delete tail;
            tail = tempTail;
        }
        return popped;
    }



    T popFront ()
    {
        T popped;

        if (head == NULL)
        {
            popped = NULL;
        }
        else if (head == tail)
        {
            popped = head->getData();
            delete tail;
            delete head;
            tail = head = NULL;
        }
        else
        {
            popped = head->getData();
            DLNode<T>* tempHead = head->getNext();
            tempHead->setPrev(NULL);
            delete head;
            head = tempHead;
        }
        return popped;
    }

[helios]

When there's only one node left in the list, you end up deleting it both the head and the tail. Since they are both the same node, you're deleting the same node twice.

[broot]

doh... that seems to have done it. thankyou :)