链表------------------单向链表的建立跟遍历

单向链表的建立与遍历

typedef struct Snode
{
	int data;
	Snode *next;
}Snode,*PSnode;


void CreateList(PSnode &head)
{
	int n;
	PSnode p,q;
	head=new Snode;
	head->data = 0;
	head->next = NULL;//Initial node
	q = head;         //负责衔接链表的 尾指针
	cout << "how many number?\n n=";
	cin >> n;
	while (n > 0)
	{
		p = new Snode;   //开辟新空间
		p->next = NULL;		
		cin >> p->data;
		q->next = p;		//衔接链表
		q = p;				//尾指针传递
		--n;
	}
	
}

void Print(PSnode&head)
{
	PSnode p = head->next;
	while (p)
	{
		cout << p->data << endl;
		p = p->next;
	}
}