node.h

简单的队列的实现

class linklist;
class node
{
	friend class linklist;
private:
	node* next;
	int data;
public:
	node(const int& item,node* pnext);
	node* returnnext();
	void setnext(node* p);
	int dat();
};
node::node(const int& item,node* pnext)
{
	//
	data=item;
	next=pnext;
}
int node::dat()
{
	return this->data;
}
node* node::returnnext()
{
	return this->next;
}
void node::setnext(node* p)
{
	this->next=p;
}