Some Terminology Of Linked List

struct node *new_node,*current;
  • Declare node variable.
Start->next
  • Access the Address field from node whose name is “Start”.
  • Start->next will gives us Address of next “Node”.
Start->data
  • Access data Stored in node whose name is “Start”.
Start->next->data
  • Access data stored in the node next to start.
if(Start->next == NULL )
  • Check whether next node of the “start” is NULL or not.
  • If null then assume that “No node is Present”
  • else assume that “There is another node”.
Start = Start->next
  • Move start to next position.