swap in queue , enqueue

[khalilshawahin]

look at this code

I want to work program for the clinic will accept patients on the basis of the patient's condition , queue by linked list .

this is the code without loop and if statement , i must have if statement to check priority , if it is ==1 "Critical condition" and i must make swap , else add them to queue .

#include <cstdlib>
#include <iostream>
#include <string>

using namespace std;


struct personal_rec
{
       string name;
       int birth;
       };
       
       struct patient
       {
              int id;
              int pr;
              string status;
              personal_rec person;
              patient *next;
              
              };

void enqueu (  patient *& , patient *&);

int main()
{
    
    patient * front=NULL , * rear=NULL;
               enqueu ( rear , front);
	return 0 ;
}



void enqueu (   patient *& front ,  patient *& rear)
{
     
    patient *n;
    n=new patient;
	cout<<"enter id"<<endl;
    cin>>n->id;
	cout<<"enter name"<<endl;
    cin >> n->person.name; 
    cout<<"enter birth"<<endl;
     cin >> n->person.birth; 
    cout<<"enter status"<<endl;
    cin >> n->status; 
    cout<<"enter priority"<<endl;
    cin>>n->pr;
	n->next=NULL;


     if(front==NULL)
     {
     front=n;
     rear=n;}
     
     else
     if(n->pr==0)
     
	 {
     rear->next=n;
     rear=n;
	 }
   else
   {// here i need code for swapping 
   }
     
 }