循环双链表的创建以及王道数据结构42页第17题

void X_C_DLinkList(DLinkList &L)
{
	L = (DLinkList)malloc(sizeof(DNode));
	L->next = L;//循环的体现
	L->prior = L;//循环的体现
	DLinkList r = L;
	int x;
	cin >> x;
	while (x != 0)
	{
		DLinkList s = (DLinkList)malloc(sizeof(DNode));
		s->prior = NULL;
		s->next = NULL;
		s->data = x;
		r->next = s;//循环的体现
		s->prior = r;//循环的体现
		r = s;
		cin >> x;
	}
}
int Symmetry(DLinkList L)
{
	DLinkList p = L->next, q = L->prior;
	while (p != q&&q->next != p)
	{
		if (p->data = q->data)
		{
			p = p->next;
			q = q->prior;
		}
		else
			return 0;
	}
	return 1;
}