queue

[khalilshawahin]

why it is print just last node were add

#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 *&);
void dequeue (patient *& , patient *&);
void print ( patient * );

int main()
{
    
    patient * front=NULL , * rear=NULL;

	int num;
	do
	{
		cout<<"1. add patient"<<endl<<"2. delete patient "<<endl<<"3. print Info"<<endl<<"enter your choice"<<endl;
		cin>>num;

		switch(num)
		{
	   	case 1:enqueu ( rear , front);
			break;
			
    	  case 2:dequeue (front , rear);
			break;		

		case 3:print ( front );
			break;
		}}
		while (num!=3);


               
	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 && front!=NULL)
     
	 {
     rear->next=n;
     rear=n;
	 }

   
      else  // here if pr=!0
if (front->pr==0 && n->pr!=0)
      {n->next=front;
       front=n;
       }
       
       else
       {
           patient *cur=front;
           while (cur->pr!=0)
           {
                 cur=cur->next;
                 }
                   cur->next=n;
       
}
	 }
	 
	 
	 
void print ( patient * front)
{
	patient *current=front;
	while (current!=NULL)
	{
		cout<<"id :"<<current->id<<endl;
		cout<<"name :"<<current->person.name<<endl;
		cout<<"birth :"<<current->person.birth<<endl;
		cout<<"status :"<<current->status<<endl;
		cout<<"priority :"<<current->pr<<endl;

		current=current->next;

	}
	getchar();
getchar();
}



void dequeue (patient *&front , patient *&rear)

{
	patient *cur;
	if(front==NULL)
		cout<<"empty";
	else
	{
		if(front->next==NULL)
		{
			delete front;
		front=rear=NULL;}


		else
		{
			cur=front;
		front=front->next;
		delete cur;
		}

	}
}

[khalilshawahin]

any answer ?

[khalilshawahin]

???????????????????

[doug4]

Your problem is that you call enqueu with arguments (rear, front), but the function is expecting (front, rear). (By the way, you misspelled enqueue.)

Also, since I was looking at your code:

If (front == NULL) fails in line , you don't need to check (front != NULL) in line 82.

In lines 99 - 102, you are walking through the elements in the list looking for one with a priority == 0. If you never find one, you will walk past the end of the list.