Skip to content

Instantly share code, notes, and snippets.

@easleyschool

easleyschool/Doubly_Linked_List_backward_traverse.c

Created October 11, 2019 02:51
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save easleyschool/d8e1e264b192f8b23499cf280f8d764d to your computer and use it in GitHub Desktop.
Save easleyschool/d8e1e264b192f8b23499cf280f8d764d to your computer and use it in GitHub Desktop.
Download ZIP
Raw
Doubly_Linked_List_backward_traverse.c
void Doubly_Linked_List :: backward_traverse()
{
node *trav;
trav = end;
while( trav != NULL )
{
cout<<trav->data<<endl;
trav = trav->prev;
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment