C++实现C语言中的链表

#include<iostream>

class CLink;
class Node
{
private:
	int mdata;
	Node* pnext;
	friend class CLink;
};
class CLink
{
public:
	CLink()
	{
		phead = new Node();
		phead->pnext = NULL;
	}
	CLink(int size)//个数
	{
		phead = new Node();
		phead->pnext = NULL;
		for (int i = 0; i < size; i++)
		{
			insertHead(0);
		}
	}
	~CLink(){}
	~CLink()
	{
		Node* pCur = phead;
		Node* pNext = pCur;
		while (pCur != NULL)
		{
			pNext = pCur->pnext;
			delete pCur;
			pCur = pNext;
		}
		phead = NULL;
	}
	void init()
	{
		phead = new Node();
		phead->pnext = NULL;
	}
	void insertHead(int val)
	{
		Node* pnewnode = new Node();
		pnewnode->mdata = val;
		pnewnode->pnext = phead->pnext;
		phead->pnext = pnewnode;
	}
	void Show()
	{
		Node* pCur = phead->pnext;
		while (pCur != NULL)
		{
			std::cout << pCur->mdata << " ";
			pCur = pCur->pnext;
		}
		std::cout << std::endl;
	}

	void destroyed()
	{
		Node* pCur = phead;
		Node* pNext = pCur;
		while (pCur != NULL)
		{
			pNext = pCur->pnext;
			delete pCur;
			pCur = pNext;
		}
		phead = NULL;
	}
private:
	Node* phead;
};
int main()
{
	int Sum();//函数声明
	CLink cl;
	CLink cl1(10);
	cl1.Show();

	cl.init();//系统调用     
	for (int i = 0; i < 10; i++)
	{
		cl.insertHead(i + 1);
	}
	cl.Show();
	cl.destroyed();
	return 0;
}