typedef struct node{
    // int data;
    int prio;
    struct node *next;
}NODE;

typedef struct queue{
    NODE *head;
}QUEUE;


// void enqueue_queue_simple(QUEUE *the_queue ,int data)
// {
//  NODE *new_node = creating_node(data);
//  if(is_empty(the_queue))
//  {
//      the_queue -> head = new_node;
//      return;
//  }
//  new_node -> next = the_queue -> head;
//  the_queue -> head = new_node;
// }

// void dequeue(QUEUE *the_queue)
// {
//  NODE *aux = the_queue -> head;
//  NODE *prev = NULL;
//  if(is_empty(the_queue))return;
//  while(aux -> next != NULL)
//  {
//      prev = aux;
//      aux = aux -> next;
//  }
//  prev -> next = aux -> next;

// }