数据结构之循环

单循环链表的理解，话不多说，看图示

数据结构

rear->data = 1; rear->next = rear;     //建立长度为1的循环单链表
 	for (int i = 2; i <= n; i++)           //依次插入数据域为2、3、…、n的结点
   	{
    	s = new Node; s->data = i;
     	s->next = rear->next;               //将结点s插入尾结点rear的后面
		rear->next = s;
    	rear = s;                         //指针rear指向当前的尾结点
   	}

| | |