Competitive Programing Problem Solutions/Graph Theory/Data Structure/Double Linked List/simple_likedlist_gfg.cpp
void printList(struct Node *node)
{
  while (node != NULL)
  {
     printf(" %d ", node->data);
     node = node->next;
  }
}
// This function prints contents of linked list starting from head

This function prints contents of linked list starting from head
This function prints contents of linked list starting from head
void printList(struct Node *node)
{
  while (node != NULL)
  {
     printf(" %d ", node->data);
     node = node->next;
  }
}
void printList ( struct Node * node ) { while ( node != NULL ) { printf ( " " , node -> data ) ; node = node -> next ; } }
This function prints contents of linked list starting from head
This function prints contents of linked list starting from head