a singly linked list operates by moving code example

Example: last index of linkedList in c

typedef struct Node {
  struct Node* next;
  int val;
} Node;



/*
The function passes through every node until it reaches the node pointing to
NULL.
input: The list pointer
output: The last node in the list.
*/
Node* getLastNode(Node* list)
{	
  	if(list)
    {
      while(list->next)
      {
       list = list->next; 
      }
    }
    return list;
}