📄 text9-4.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">(2) <font color="#FF0000">deletion of min element</font>
<img src="image/text9-f0.gif" width="383" height="139">
<img src="image/text9-f.gif" width="342" height="123">
the <i><font color="#FF0000">two cases</font></i> for <font color="#FF0000">reinserting </font>an element item into a min-max-heap :</font></b></pre>
<table width="72%" border=" " cellspacing="0">
<tr>
<td width="64%" height="450">
<pre><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">① <i><font color="#0033CC">The root has no children</font></i>
--> item is to be inserted into the root
② <i><font color="#0033CC">The root has at least one child </font></i>
determine which node has the smallest key
( node k )
(a) <i><font color="#0033CC">item.key <= heap[k].key</font></i>
--> item is to be inserted into the root
(b) <font color="#0033CC"><i>item.key > heap[k].key</i></font> and k is a child of
the root
--> element heap[ k ] may be moved to the
root and item insert into node k
(c) <i><font color="#0033CC">item.key > heap[k].key
</font></i><font color="#0033CC"><i><font color="#FF0000">and </font></i></font><i><font color="#0033CC">k is a grandchild</font></i>
-->element heap[ k ] may be moved to the root
<font color="#FF0000">I<font size="3">F</font></font><font size="3"> item.key > heap[ parent ].key ( the parent of k )
--> heap[ parent ].key and item are to be
interchanged .</font>
<font color="#FF0000"> ELSE</font><font size="3"> --> insert item into the sub-heap with</font>
root k …
</font></b></pre>
</td>
<td width="36%" height="450">
<pre><img src="IMAGE/abc.gif" width="219" height="403"></pre>
</td>
</tr>
</table>
<p> </p>
<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-3.htm">上一页</a>
<a href="text9-5.htm">下一页</a></b></font></td>
</tr>
</table>
<p> </p>
<pre align="left"><b></b></pre>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -