Skip to content

Instantly share code, notes, and snippets.

What would you like to do?
void Doubly_Linked_List :: backward_traverse()
node *trav;
trav = end;
while( trav != NULL )
trav = trav->prev;
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.