{
      Node* iterator;
      Node *newNode = makeNode(value);
      if (q->head == NULL)
      {
            q->head= newNode;
            return;
      }
      iterator = q->head;
      while (iterator != NULL)
      {
            iterator = iterator->next;
      }
      iterator->next = newNode;
      return;
}