LinkedList_addAtEnd.c

/*
   Inserts the element at the end
   @param: n as a pointer to the node to add
*/
int LinkedList :: addAtEnd(node *n) {
  
  //If list is empty
  if(head == NULL) {
    
    //making the new Node as Head
    head = n;
    
    //making the next pointe of the new Node as Null
    n->next = NULL;
  }
  else {
    
    //getting the last node
    node *n2 = getLastNode();
    
    n2->next = n;
  }
}

/*
   gets the last node
   @returns: the pointer to the last node
*/
node* LinkedList :: getLastNode() {
  
  //creating a pointer pointing to Head
  node* ptr = head;
  
  //Iterating over the list till the node whose Next pointer points to null
  //Return that node, because that will be the last node.
  while(ptr->next!=NULL) {
    
    //if Next is not Null, take the pointer one step forward
    ptr = ptr->next;
    
  }
  
  return ptr;
}