简单队列实现

class MyQueue
{
public:
MyQueue();
bool Get(int *&p);
bool Put(int a);
int GetLength();
private:
struct Node * rear;
struct Node * front;
int length;
};

MyQueue::MyQueue()
{
struct Node *tmp = new struct Node;
tmp->next = NULL;
rear=front=tmp;
length=0;
}

bool MyQueue::Put(int a)
{
struct Node *tmp;

if(length < MAX)
{
rear->data=a;

struct Node *tmp = new struct Node;
tmp->next=NULL;
rear->next = tmp;
rear = tmp;
length++;

return true;
}
else
return false;
}

bool MyQueue::Get(int *&p)
{
if(rear == front)
{
return false;
}
else
{
struct Node *tmp = front;
*p = tmp->data;
front = front->next;
--length;
delete tmp;
tmp = NULL;
return true;
}
}

MyQueue::~MyQueue()
{
if(rear!=front)
{
while(front !=NULL)
{
struct Node *tmp = front; 
front = front->next;
delete tmp;
tmp= NULL;
}
rear = front =NULL;
}
}

int MyQueue::GetLength()
{
return length;
}