📄 text5-5.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">第五章</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">
<b><font face="Arial, Helvetica, sans-serif" size="5" color="#FF0000">5.2 Binary Tree</font><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">
【<font color="#0033CC">definition</font>】A binary tree is a finite set of nodes that is either
empty or consists of a root and two disjoint binary trees called
the left subtree and the right subtree.
<font color="#FF0000">note: </font><i>a binary tree is really a different object than a tree
</i>
1)<font color="#FF0000"> The Abstract Data Type
</font>
---------------------------------------------------------------------------------------
</font></b><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"><font color="#FF0000">structure</font> Binary_Tree (abbreviated BinTree) is
<font color="#0033CC">objects: </font> a finite set of nodes either empty or consisting of
a root node, left Binary_Tree, and right
Binary_Tree .
<font color="#0033CC"> funtion:</font>
for all <i>bt, bt1, bt2 </i> <img src="IMAGE/belong.gif" width="17" height="13"> BinTree, <i>item</i> <img src="IMAGE/belong.gif" width="17" height="13"> element
<font color="#FF0000">BinTree Creat( ) </font>::= creats an empty binary tree
<font color="#FF0000">Boolean Isempty( bt ) <font color="#000000">::= if ( bt == empty binary tree)</font></font>
return TRUE else return FALSE
<font color="#FF0000">BinTree MakeBT(bt1,item,bt2)</font>
::= return a binary tree whose left subtree is
bt1, whose right subtree is bt2, and who-
se root node contains the data item.
<font color="#FF0000">BinTree Lchild (bt ) </font>::= if ( <i>Isempty( bt )</i>) return error
else return the left subtree of bt.
<font color="#FF0000">element Data(bt) </font>::= if (<i>Isempty( bt )</i>) return error
else return the data in the root node of bt.
<font color="#FF0000">BinTree Rchild(bt) </font>::= if(<i> Isempty( bt )</i>) return error
else return the right subtree of bt.
--------------------------------------------------------------------------------------- </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="text5-index.htm"></map></a></td>
<td width="131"><font face="楷体_GB2312" size="2"><b><a href="text5-4.htm">上一页</a>
<a href="text5-6.htm">下一页</a></b></font></td>
</tr>
</table>
<pre align="left">
</pre>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -