写出带头结点的双向循环链表L为空表的条件 。
head = front
head.next=head; head.prior =head;
L->next=L->prior=L
L->next==L->prior==L;
L->next == L; L->prior ==L;
写出带头结点的双向循环链表L为空表的条件 L->prior=L->next=L 。
head->netx=head&&head->prior=head;
head->next==head
head->prior==head
head->front = head->rear = NULL;
L->next==L && L->prior==L
L->next==L&&L->prior==L
L->next = L && L->prior = L
L -> prior == L && L -> next == L
head->prior==head && head->next==head
L->prior == L
prior
L->next == L
next
L→next == L → prior
L->prior==L&&L->next==L
L->next=head
L->prior=L->next=L
head->next=L&&head->prior=L
前驱=后继=L
（L->rear+1）%MaxSize==L->front
head->next=head;head->prior=head;
head->next=head&&head->prior=head
L->next=L
L->next=L&&L->prior=L
L->next=L;
head->next==NULL&&head->pre=NULL
1
L->next==L&&L->prior==L;
L->next==L->prior==NULL
L->next==L
head->next=head=head->prior
L->next = L;
L->prior = L;
L－＞next=L－＞prior=L
11
// 假设L是头结点的指针 if (L->next == L && L->prev == L) { // 链表为空 }
L->next==L && L->prev==L
L->next==L->next==L
head=null
L=L->next=L->prior=NULL;
head ->prior == head && head ->next == head
head->prior == head && head->next == head;
head->prior=head;
head->next=head;
head->prior=head
head->next=head
head->next==head;
head->piror==head;
L->next=head且prior的=head
head->prior = head, head-next = head
head->next == head && head->prior == head
l-prior=l，l-next=l
head -> next = head;
head ->prior = head;
head->next=head head->prior=head
L -> next == L && L -> prior == L
head -> next = NULL;
L->next==L->prior==L
L->prior==L
L->next==L&&L->pre==L
L->next==L L->prior==L
L.next == L || L.prev == L
2375725034 回复 moonya： 要用&&
head->next=head->prior
L->prior=L;
L->next = Null;
L->prior = null;
L->next =L->prior =L
L->next = null;
L->next==L;
L->prior==L;
L-prior=L;
L-next=L;
L→next＝null;L→prior＝null
L->next == L->prior == L
L->prior=l->next=l
l->next=head,l->p->piror=head
写出带头结点的双向循环链表L为空表...
用户登录可进行刷题及查看答案
The road of your choice, you have to go on !
粤ICP备16082171号-1
登录后提交答案