push_linked.c

 void push_list(LinkedList* list, int value){
     Node* n;

     n=(Node*)malloc(sizeof(Node)); //intializing new node
  
     n->value=value; //setting value of new node

     if(!list->tail){
         //It means we are pushing our first node, so intially header and tail node will be same
         list->head=n;
         list->tail=n;   
     }

    //As tail points to the last element of the list, we will set new node as next element of tail element 
     
      list->tail->next=n; 
      list->tail=n; //As from the above statement n is our new tail, we set new node as tail of list
      


        list->length++; // Increasing length of list

    }