text5-27.htm
来自「浙江大学计算机学院数据结构课程的教学课件」· HTM 代码 · 共 48 行
HTM
48 行
<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">第五章</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"><a href="../text9/text9-0.htm">第九章</a></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"><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"><b>
<font color="#FF0000">ABSTRACT DATA TYPE</font>
-----------------------------------------------------------------------------------------
structure <font color="#FF0000">MaxHeap </font>is
<font color="#0033CC">objects</font>:a complete binary tree of n>0 elements organized
so that the value in each node is at least as large
as those in its children
<font color="#0033CC">function:</font>
for all heap <img src="IMAGE/belong.gif" width="13" height="12"> MaxHeap, item <img src="IMAGE/belong.gif" width="13" height="12"> Element, n, max_size <img src="IMAGE/belong.gif" width="13" height="12"> integer
<font color="#FF0000">
MaxHeap create(max_size)</font> ::= create an empty heap that
can hold a maximum of
max_size elements.
<font color="#FF0000"> Boolean HeapFull(heap,n) </font> ::= if (n == max_size) return
TRUE else return FLASE
<font color="#FF0000"> MaxHeap Insert(heap,item,n)<font color="#000000">:</font></font><font color="#000000">:</font>= if ( !HeapFull (heap,n))
insert item into heap and
return the resulting heap
else return error
<font color="#FF0000"> Boolean HeapEmpty(heap,n)</font>::= if ( n>0 ) return TRUE
else return FALSE
<font color="#FF0000"> Element Delete(heap,n) </font> ::= if ( !HeapEmpty(heap,n)
return one instance of the
largest element in the
heap and remove it from
the heap else return error.
</b></font></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="text5-index.htm"></map></a></td>
<td width="131"><font face="楷体_GB2312" size="2"><b><a href="text5-26.htm">上一页</a>
<a href="text5-28.htm">下一页</a> </b></font></td>
</tr>
</table>
</body>
</html>
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?