implementing linked lists in c++

[dynamo]

hi guys
i have this problem with the linked list algorithm,it seems every time a new link object is added it overwrites the preceding one(at least it seems so in java which the code for the algorithm is in though i want to implement it in c++)

public void insertFirst(int id, double dd)
{ // make new link
Link newLink = new Link(id, dd);
newLink.next = first; // newLink --> old first
first = newLink; // first --> newLink
}

this is the code i have a problem with,specifical ly.Thanks
p.s pls dont tell me how java handles objs.My problem is with this part of the algorithm itself(regardle ss of language).

[boxfish]

As long as you make sure that you're using pointers to links and not actual links, you should be fine. Here is this written in C++ incorrectly, without pointers, so that newLink overwrites what is in first:

void LinkedList::insertFirst(int id, double dd) 
{ // make new link
Link newLink(id, dd);
newLink.next = first; // newLink --> old first
first = newLink; // first --> newLink
}

But if you use pointers like this, it should work fine:

void LinkedList::insertFirst(int id, double dd) 
{ // make new link
Link *newLink = new Link(id, dd);
newLink->next = first; // newLink --> old first
first = newLink; // first --> newLink
}

Hope this clarifies this a bit.

[fresh78]

Таke a look at singly-linked list tutorial. It also has a C++ code.