Need help with unsorted linked list

[Gldnbr]

delete

[10oTURfi]

At first glance... look at constructor:
head->next = NULL;
This can't happen, because you never new'd the head.

[Gldnbr]

delete

[10oTURfi]

Woah.

void List::Insertitem(ItemType x)
{
	NodeType *newNode = new NodeType;
	newNode->item = x;
	newNode->next = NULL;
	newNode = head;
}

What is this supposed to do?

Constructor should only set head to NULL
head = NULL;

And the insert function should look something like this:

void Insertitem(int data)
    {
        if(!head)//If head wasnt new'd yet
        {
            head = new NodeType;
            head->item = data; // set the head
            head->next = 0;
        }
        else 
        {
            NodeType* iter = head;
            while(iter->next) //else find end of list
            {
                iter = iter->next;
            }
            NodeType* _new = new NodeType; //and add element
            _new->item = item;
            iter->next = _new;
            _new->next = 0;
        }
    }

(I hope I didnt make mistake)

[Gldnbr]

delete

[Gldnbr]

delete

[LB]

Please do not blank your posts - if others have the same problem as you, they can no longer find the information they need.