• Advertisement
Sign in to follow this  

Linked Lists

This topic is 4894 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

If I wanted to compare the info in a node: if (current->f(n) < current->nxt->f(n)) would i have to create a new pointer *next and do next = current->next; if(current->f(n) < next->f(n)) Thanks

Share this post


Link to post
Share on other sites
Advertisement
nope, you could even test against the 3rd element assuming it's there...
<code>
if(current->f(n) < (current->nxt->next->f(n)))
{
...
}
</code>

Share this post


Link to post
Share on other sites
Quote:
Original post by Betrayer_of_Code
If I wanted to compare the info in a node:
if (current->f(n) < current->nxt->f(n)) would i have to create a new pointer *next and do

next = current->next;
if(current->f(n) < next->f(n))


Hi,

As long as you are sure that there *is* a next pointer, you don't have to put it in another variable. So if you do something like:


if (current->next != NULL)
if (current->data < current->next->data)
/* Do stuff here */



Vovan

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement