Linked List Delete Node

[msrt92]

When I delete first node it work fine..
But when I want to delete specific node its not working fine :(

for example
# Value
1 12
2 22
3 32
4 42
5 52

here i want to delete Node 3
But outPut come like this...
# Value
1 12
2 22
3 32

Here I only want to delete Node # 3

  void deleteNode(int num)
{
	int pos=1;
	node *temp, *pre;
	temp=start;			// assigning start node address to temp
	if(temp==NULL)   // Checking list is empty?
	{
		cout<<"*************List Is empty************";
		return;
	}
	if(num==pos)					// If user want to delte first node 
	{
		if(temp->next==NULL)	// checking first node is last?
		{
			start=NULL;		// List Will Become Empty
			cout<<"There Was Only One Node ... Now List Is Empty";
			return;
		}
		start=temp->next;
		return;
	}
	while (temp->next!=NULL)
		{
			pre=temp;
			temp=temp->next;
			pos++;
			if(pos==num)
			{
				if(temp->next=NULL)
				{
					pre->next=NULL;
					cout<<"You Deleted Last Node Of Your List..."<<endl;
					return;
				}
				else
				{
					pre->next=temp->next;
					return;
				}
			}
		}
}

[shadowCODE]

Try this.
You cross over temp in line 37 pre->next=temp->next but you don't delete temp from the list.

Your code does not tell whether this is C or C++m
C:

pre->next=temp->next;
free(temp);

C++

pre->next=temp->next;
delete temp;

[msrt92]

thank you so much for your precious time :)

I'm using C++
Here I am not deleting the node but removing its address from list. I will use the delete function after this, still I am understanding linking of nodes.

[shadowCODE]

Can we see your print function

[msrt92]

Here It is..... node *start... is public...

void display()
{
	node *temp;
	int num=1;
	temp=start;
	if(temp==NULL)
	{
		cout<<"Link List Is Empty...."<<endl;
		return;
	}
	cout<<"Node #"<<setw(10)<<"Value"<<endl;
	while(temp!=NULL)
	{
		cout<<setw(2)<<num<<setw(11)<<temp->value<<endl;
		temp=temp->next;
		num++;
	}
	cout<<endl;
}

[msrt92]

Still Have Problem