Anyone? :(
Ok so it's all deleting the nodes fine and updating the links, except when i go to remove the 1st node - it has a problem. Could someone please...
Your code works fine (the sample), but that's only because each node is only linked to it's next node. My scenario is a little more complicated....
The problem i got now is the following, and i'd REALLY be grateful if someone could assist me with this. Lets say i have 6 nodes and the long link...
I'm really stuck now :( some of the long links of the nodes that were referncing to the delete node now have ridiculous long link numbers :( (like...
Here is my code to make it better to understand (Hopefully) node *newnode = current; node *temp = current; node *start = current; int...
I understand that. I know it's just 2 nodes behind, but in terms of making the code go 2 nodes behind, that's a little tricky. Technically, the...
Thanks for your feedback coderzone. Just let me know if this approach is right (well i'm assuming it's not as it's not working). Assuming the...
Can anyone help me out please?
I've tried other pieces of code and changing it slightly, but the number variable refuses to go into my do/while loops, or my while or for loops....
I have a slight issue yet again. The code is: for (int z = 1; z <= length; z++) { if (longlinker -> longlink -> num == number) { longlinker...
Ok where exactly do you see that?
I have another question. If i remove all the nodes in the linked list, how would i go about actually displaying that there's nothing left?
for (int j = 1; j < length; j++) // this loop is to determine that if the first node gets deleted - then linker will point to the last node {...
This is my attempt at that code to try and make it in terms of fitting it into mine, but no node is getting deleted but rather nodes are merely...
What does "free" mean in the code you gave me ? Is it just delete? If so, how can you delete something like newnode -> next -> next ?
I've properly commented my code so hopefully this will help you a little further: void ring::remove(int x) { node* prev = current ->...
Is that deleting the nth node (which can be any random node) or a particular one? Nevermind that question actually. Ok i sort of understand that...
I'm not too sure what the problem is but it won't allow me to delete the 2nd node. I tried another piece of code but now when i try to delete node...
Hi - i just needed some help. I'm constructing a circular linked list which means 1st node points to 2nd, and so on. The task i need to accomplish...
Separate names with a comma.
