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

．[题目分析] 在无序的单链表上查找最小值结点要查遍整个链表初始假定第一结点是最小值结点当找到最小值结点后判断数据域的值是否是奇数若是则与其后继结点的值相交换即仅仅交换数据域的值用三个赋值语句即可交换若与后继结点交换位置则需交换指针这时应知道最小值结点的前驱至于删除后继结点则通过修改最小值结点的指针域即可

[算法设计]

void MiniValue(LinkedList la)∥la是数据域为正整数且无序的单链表本算法查找最小值结点且打印若最小值结点的数值是奇数则与后继结点值交换;否则就删除其直接后继结点

{p=la>next;∥设la是头结点的头指针p为工作指针

pre=p;∥pre指向最小值结点初始假定首元结点值最小

while(p>next!=null)∥p>next是待比较的当前结点

{if(p>next>data<pre>data)pre=p>next;

p=p>next;∥后移指针

}

printf(最小值=%d\npre>data);

if(pre>data%!=)∥处理奇数

if(pre>next!=null)∥若该结点没有后继则不必交换

{t= pre>data;pre>data=pre>next>data;pre>next>data=t;}∥交换完毕

else∥处理偶数情况

if(pre>next!=null)∥若最小值结点是最后一个结点则无后继

{u=pre>next;pre>next=u>next;free(u);} ∥释放后继结点空间

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