Merge_two_queues function

LQueue.C

Queue Queue::merge_two_queues(Queue & q){
  NodePointer queue1 = myFront;
  NodePointer queue2 = q.myFront;
  Queue newQueue;

  while (queue1 != NULL || queue2 != NULL){
    if (queue1 == NULL){
      newQueue.enqueue(queue2->data);
      queue2 = queue2->next;
    } else if (queue2 == NULL) {
      newQueue.enqueue(queue1->data);
      queue1 = queue1->next;
    } else if (queue1->data == queue2->data) {
      newQueue.enqueue(queue1->data);
      newQueue.enqueue(queue2->data);
      queue1 = queue1->next;
      queue2 = queue2->next;
    } else if (queue1->data < queue2->data) {
      newQueue.enqueue(queue1->data);
      queue1 = queue1->next;
    } else if (queue1->data > queue2->data) {
      newQueue.enqueue(queue2->data);
      queue2 = queue2->next;
    }
  }
  return newQueue;
}