typedef struct nodo{
                  int dato;
                  struct nodo* next;
                }Nodo
                Nodo *front = NULL;
                Nodo *rear = NULL;
              

                void enqueue(int x){
                  Nodo *temp=(Nodo *)malloc(sizeof(Nodo));
                  temp->dato = x;
                  temp->next = NULL;
                  if(front == NULL && rear == NULL){
                    front=rear=temp;
                    return;
                  }
                  rear->next = temp;
                  rear=temp;
                }
              

                void dequeue(){
                  Nodo *temp = front;
                  if(front == NULL)´
                  printf("La cola esta vacia\n");
                  return;
                }
                if(front == rear)
                  front=rear=NULL;
                else
                  front=front->next;
                printf("Eliminaste %d", temp->dato);
                free(temp);