c++队列

结点构造不再重复

TQueue::TQueue(){headNode = NULL;rearNode = NULL;length    = 0;}TQueue::~TQueue(){delete headNode;delete rearNode;}void TQueue::exit(){if (length){headNode = headNode->next;length--;}else{cout<<"空队"<<endl;}}void TQueue::enter(int data){if (0 == length){rearNode = new Node();rearNode->data = data;headNode = rearNode;rearNode->next = NULL;}else {Node *tempNode = new Node();tempNode->data = data;rearNode->next = tempNode;rearNode = tempNode;}length++;}void TQueue::printQueue(){if (length){int index = length;Node* tempNode = new Node();tempNode = headNode;while (index){cout<< tempNode->data <<" ";tempNode = tempNode->next;index--;}cout<<endl;delete tempNode;}else{cout<<"空队"<<endl;}}int  TQueue::GetLenth(){return length;}