#include <iostream>

using namespace std;


struct node 
{
	int val;
	node *next;
};

void enqueue(node *&Q, node *&t, int x)           //dodawanie 
{
    node *p=new node;
    p->val=x;
    p->next=NULL;
    if (Q==NULL)
      {
        Q=p;
      }
    else
      {
        t->next=p;  
      }
    t=p;
}


void dequeue(node *&Q, node *&t)          //usuwanie 
{
    if (Q !=NULL)
    {
        node *p=Q;
        Q=Q->next;   //alt wersja: Q=p->next
        delete p;
        
    }
    if (Q==NULL)
    {
        t=NULL;
    }
}


bool isEmpty (node *Q)
{
    if(Q==NULL)return true;
    else return false;
}

void showfront(node *Q)
{
    
    if (Q !=NULL)
    {
        node *p=Q;
        cout<<"->";
     cout<<p->val;
    }    
    
}


void showback(node *t)
{
    if (t !=NULL)
    {
        node *p=t;
        cout<<"->";
     cout<<p->val;
    }    
}

int main()
{
    
    node *Q=NULL;
    node *t=NULL;

	enqueue(Q,t, 5);	
	enqueue(Q,t, 22);
	showfront(Q);
	dequeue(Q,t);
	showfront(Q);
  

    return 0;
}


///ZAD DOM 1: co drugi element ze stosu przerzuć na kolejkę;
///ZAD DOM 2; co drugi element z kolejki przerzuć na stos;