Thread: Assignment operator help.

Code:

if (current==start_ptr)
          cout<<"you are at the end of the list"<<endl;
else 
{ node *previous; //declare pointer
   previous=start=start_ptr;

    while (previous->nxt !=current)
         {   previous=previous->nxt;
          }
current=previous; // would this work the same if it
were previous=current?
}

//This is just to gain access no a previous node on a linked list

That should work, but it would be much simpler to just have a whisker pointer to feel ahead of current and you can use current to read the values.

Code:

node *current = head, *whisker = current->next;
while ( whisker != start_ptr ) {
  if ( whisker->key == someValue ) {
    cout<<current->value<<endl; 
    break;
  }
  else
    current = whisker; whisker = current->next;
}

The whisker is also immensely useful in deleting a node in a single linked list.

-Prelude