Insertion Queue

[greyhound]

The program is required to read from queue.txt output to the screen giving female as priority.

The program works like a Priority queue where the female will be inserted to queue first before the gentleman...

I can't read my queue.txt & not sure what's wrong. Pls advise me.

[queue.txt]
F Mary1
M Wilson1
F Mary2
F Mary3
M Wilson2
F Mary4

How can I perform insertion queue

#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;

const int MAX = 30;

class People
{
friend ostream& operator << (ostream&, People&);

public:
People(); // Perform nothing
People(char [],char);
People(const Person&);

char getSex () const;
People& operator*= (const People&);

private:
char name [MAX];
char sex;
};

struct Node;
typedef Node* NodePtr;

struct Node
{
People p;
NodePtr next;
};

class Queue
{
friend ostream& operator << (ostream&, Queue&);

public:
Queue(); // head&tail

void enqueue (const People&); // insert person to Q
People dequeue (); //delete person from Q

int getSize(); //get size of infile
bool isEmpty(); // if Q isEmpty

private:
NodePtr head, tail;
static int size;

};

int Queue::size = 0;



//Classes Functions

People::People (char name[],char sex)
{
int i= 0;
while (i<MAX)
{
if(name[i] != '\0')
strcpy(name[i],name[i]);
else
i++;
}
this-> sex = sex;
}

People::People (const People& p)
{
int i= 0;
while (i<MAX)
{
if(name[i] != '\0')
this->name[i]=p.name[i];
else
break;
i++;
}
this-> sex = p.sex;

}

void Queue::enqueue (const Person& name)
{
NodePtr temp = new Node;
temp -> p = name;
temp -> next = NULL;

if (tail == NULL)
head = temp;
else
tail -> next = temp;

tail = temp;
size++;
}


//Main function

int main ()
{
	char name [MAX];
	char sex;
	fstream infile;
	Queue q;
	
	q.dequeue ();
	
	infile.open ("queue.txt", ios::in);	
	if (!infile.good())
	{
		cout <<" opened for reading failed" << endl;
		cout << "End of task" << endl;
		exit (1);
	}
	else
	{
		cout << " successfully opened for reading" << endl;
	}
	
	while (!infile.eof())
	{
		for (int i=0;i<MAX;i++)
		{
			infile << name[i];
			q.enqueue (name[i]);
		}
	}
		
	infile.close();	
}