Help with pointers

Hi,

If there is a Dummy head in the list. I need to insert a new node pointed by NewPtr at the beginning of the list.

From what I read, I understood that dummy head is used to get exclude the special cases.
So the solution:

NewPtr->next=head;
Head=NewPtr;

is not applicable, coz that is what is being used for the special case.
What would be a similar code segment for the list that uses dummy head.

I have a solution, but i am not sure if it is right:

Head->Next=NewPtr;
NewPtr->Next=Head->Next;


Can you please advise, and if possible explain.
Thanks.

GipsyAsked:
Who is Participating?

[Product update] Infrastructure Analysis Tool is now available with Business Accounts.Learn More

x
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

tinchosCommented:
Just a minor change

NewPtr->Next=Head->Next;
Head->Next=NewPtr;

With your code

Head->Next=NewPtr;  // Here you lose the old head->next
NewPtr->Next=Head->Next;  // So you cannot assign it here
tinchosCommented:
Just a little more clarification

The idea of your code I believe it was right

The only problem is that the old value of head->next was  being lost.
This means, that after the first line of your code, the pointer to the head of the list was being overwritten, and when you tried to set the next element of the new head of the list, you were assigning it to itself.......

After running this

Head->Next=NewPtr;
NewPtr->Next=Head->Next;

you find NewPtr->Next = NewPtr and I believe that this is not the idea

I believe that you just have to swap the order of the instructions as I previously mentioned

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
GipsyAuthor Commented:
Thanks, can you briefly explain what your code does, I am new to pointers and trying to understand how it works. Thanks
tinchosCommented:
Well, I believe that this is worth more than 30 points, but that's up to you............ here's my explanation

suppose you have a list with 5 elements

( 1 2 3 4 5 )

and you want to add a new element in the beggining containing 0.

then

before the insertion you have

head->next is pointing to the node containing the 1 (lets call it node1)
node1->next is pointing to the node containing the 2 (lets call it node2)
node2->next is pointing to the node containing the 3 (lets call it node3)

so, in some pseudocode

head->next = node1          // The first element is node1
node1->next = node2
node2->next = node3
and so on

if you want to add a new node containing 0 (lets call it node0 )

then, you want to do

node0->next = node1           // As you want the 0 to be before the 1

and the first element is no longer node1, it is node0, so

head->next=node0

so in the end you have

head->next=node0
node0->next = node1
node1->next = node2
node2->next = node3
and so on

and in this way you represent

( 0 1 2 3 )

I hope its clear enough

any doubts feel free to ask them
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
C++

From novice to tech pro — start learning today.