📄 text9-20.htm
字号:
<html>
<head>
<title>Untitled Document</title>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
</head>
<body bgcolor="#FFFFFF" link="#0000FF" vlink="#3399FF" alink="#FF0066">
<div id="Layer1" style="position:absolute; width:711px; height:21px; z-index:1; top: 10px; background-color: #CCCCCC; layer-background-color: #CCCCCC; border: 1px none #000000; left: 26px"><b>|</b><font face="宋体" size="2"><a href="../text1/text1-0.htm">第一章</a></font><b>|</b><font face="宋体" size="2"><a href="../text2/text2-0.htm">第二章</a></font><b>|</b><font face="宋体" size="2"><a href="../text3/text3-0.htm">第三章</a></font><b>|</b><font face="宋体" size="2"><a href="../text4/text4-0.htm">第四章</a></font><b>|</b><font face="宋体" size="2"><a href="../text5/text5-0.htm">第五章</a></font><b>|</b><font face="宋体" size="2"><a href="../text6/text6-0.htm">第六章</a></font><b>|</b><font face="宋体" size="2"><a href="../text7/text7-0.htm">第七章</a></font><b>|</b><font face="宋体" size="2"><a href="../text8/text8-0.htm">第八章</a></font><b>|</b><font face="宋体" size="2">第九章</font><b>|</b><font face="宋体" size="2"><a href="../text10/text10-0.htm">第十章</a></font><b>|</b><font size="2" face="宋体"><a href="../textA/textA-0.htm">算法分析</a><b><font color="#000000">|</font></b>
</font></div>
<pre align="left"><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">
(5) <font color="#FF0000">deletion of min element</font>
<i><font color="#0033CC">step1:</font></i> [Handle empty B-heap]
if (a = NULL) deletion_error else perform step 2- 4
<i><font color="#0033CC"> step2:</font></i> [Deletion from nonempty B-heap]
x = a->data; y = a->child ; delete a from its doubly
linked circular list; Now, a pointer to any remaining
node in the resulting list; If there is no such node,
then a = NULL
<i><font color="#0033CC"> step3:</font></i> [Min-tree joining]
Consider the min-tree in the list a and y; joining
together pairs of min-tree of the same degree until
all remaining min-trees has different degree;
<i><font color="#0033CC"> step4:</font></i> [Form min-tree root list]
Link the roots of the remaining min-tree ( if any )
together to form a doubly linked circular list; Set a
to point the root ( if any ) with minimum key; new
B-heap consist of the remaining min-tree and the
sub min-tree of the deleted root
<img src="image/text9-t.gif" width="393" height="100">
<i><font size="3" color="#CC0099"> making the min-tree whose root has larger key a subtree of the other
</font></i>
<img src="image/text9-u.gif" width="389" height="110">
<img src="image/text9-v.gif" width="388" height="145">
<font color="#FF0000"><i><font color="#0033CC">for (degree = p->degree; tree[degree]; degree++) {
join_min_trees(p , tree[degree]);
tree[degree] = NULL;
}
tree[degree] = p;
</font></i></font></font></b></pre>
<table width="731" cellspacing="0" cellpadding="0">
<tr>
<td width="327"> </td>
<td width="271"><a href="../index.htm"><img width="60" height="25" usemap="#MapMap4" border="0" src="../../images/home.gif"></a><a href="../index.htm"><map name="MapMap4"><area shape="rect" coords="42,-34,88,-15" href="text0.htm"><area shape="rect" coords="4,4,55,23" href="text9-index.htm"></map></a></td>
<td width="131"><font face="楷体_GB2312" size="2"><b><a href="text9-19.htm">上一页</a>
<a href="text9-21.htm">下一页</a></b></font></td>
</tr>
</table>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -