数据结构之设置尾指针的单向循环链表(参考整理严蔚敏数据结构)

#include<iostream>
using namespace std;
typedef int ElemType;
typedef struct Node
{
	ElemType data;
	Node *pNext;
}Node;
typedef Node *Link;
//设立尾指针的单向循环链表
void InitList(Link &L)
{//生成只有一个头结点的空表
	L = new Node;
	L->pNext = L;
}

void DestroyList(Link &L)
{
	Link q, p = L->pNext;//p指向头节点
	while (p != L)//没到表尾
	{
		q = p->pNext;
		delete p;
		p = q;
	}
	p = q = NULL;
	delete L;
	L = NULL;
}

void ClearList(Link &L)
{//改变L
	Link p, q;
	L = L->pNext;//L指向头结点
	p = L->pNext;//p指向第一个结点
	while (p != L)//没到表尾
	{
		q = p->pNext;
		delete p;
		p = q;
	}
	p = q = NULL;
	L->pNext = L;// 头结点指针域指向自身
}

bool ListEmpty(Link L)
{
	return L->pNext ==