Solved

Help with pointers

Posted on 2003-10-22
4
202 Views
Last Modified: 2010-04-02
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.

0
Comment
Question by:Gipsy
  • 3
4 Comments
 
LVL 9

Expert Comment

by:tinchos
ID: 9600701
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
0
 
LVL 9

Accepted Solution

by:
tinchos earned 30 total points
ID: 9600825
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
0
 

Author Comment

by:Gipsy
ID: 9600883
Thanks, can you briefly explain what your code does, I am new to pointers and trying to understand how it works. Thanks
0
 
LVL 9

Expert Comment

by:tinchos
ID: 9600937
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
0

Featured Post

Why You Should Analyze Threat Actor TTPs

After years of analyzing threat actor behavior, it’s become clear that at any given time there are specific tactics, techniques, and procedures (TTPs) that are particularly prevalent. By analyzing and understanding these TTPs, you can dramatically enhance your security program.

Join & Write a Comment

When writing generic code, using template meta-programming techniques, it is sometimes useful to know if a type is convertible to another type. A good example of when this might be is if you are writing diagnostic instrumentation for code to generat…
Go is an acronym of golang, is a programming language developed Google in 2007. Go is a new language that is mostly in the C family, with significant input from Pascal/Modula/Oberon family. Hence Go arisen as low-level language with fast compilation…
The viewer will learn additional member functions of the vector class. Specifically, the capacity and swap member functions will be introduced.
The viewer will learn how to clear a vector as well as how to detect empty vectors in C++.

706 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question

Need Help in Real-Time?

Connect with top rated Experts

17 Experts available now in Live!

Get 1:1 Help Now