数据结构考研分类复习真题 第二章 答案[4]

．()la () ()j<i ()p↑next ()i<

()head^left:=s∥head的前驱指针指向插入结点

()j:=;

()p:=p^right∥工作指针后移

()s^left:=p

()p^right^left:=s;∥p后继的前驱是s

()s^left:=p;

()i<=Llast∥Llast 为元素个数

()j:=j+∥有值不相等的元素

()Lelem[j]:=Lelem[i]∥元素前移

()Llast:=j∥元素个数

(A)p^link:=q;∥拉上链前驱指向后继

(B)p:=q;∥新的前驱

(C)p^link:=head;∥形成循环链表

(D)j:=;∥计数器记被删结点

(E)q:=p^link∥记下被删结点

(F)p^link=q^link∥删除结点

()p:=r;∥r指向工作指针s的前驱p指向最小值的前驱

()q:=s;∥q指向最小值结点s是工作指针

()s:=s^link∥工作指针后移

()head:=head^next;∥第一个结点值最小;

()p^link:=q^link;∥跨过被删结点(即删除一结点)

．() l^key:=x;∥头结点l这时起监视哨作用

() l^freq:=p^freq∥头结点起监视哨作用

() q>pre>next=q>next; q>next>pre=q>pre;∥先将q结点从链表上摘下

q^next:=p; q^pre:=p^pre; p^pre>next:=q; p^pre:=q;∥结点q插入结点p前

() q^freq=∥链表中无值为x的结点将新建结点插入到链表最后(头结点前)

[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []