📄 text5-33.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="4" color="#000000">(1)<font color="#FF0000"> Searching a binary search tree O(h)</font>
<i><font color="#0033CC"> </font></i><font color="#0033CC"><i>Recursive search of a binary search tree</i></font></font></b></pre>
<table width="740" cellspacing="0">
<tr>
<td width="538">
<pre><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">tree_pointer <font color="#FF0000">search</font>(tree_pointer root,int key)
{ <i><font size="3" color="#CC0099"> /* return a pointer to the node that contains key.If
there is no such node,return NULL. */ </font></i>
if ( !root ) return NULL;
if (key == root->data) return root;
if (key < root->data)
return <font color="#FF0000">search</font> (root->left_child, key);
return <font color="#FF0000">search</font> (root->right_child, key);
} </font></b></pre>
</td>
<td width="196">
<pre><img src="IMAGE/text5-wa.gif" width="176" height="116"></pre>
</td>
</tr>
</table>
<pre align="left"><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"><font color="#0033CC"><i> Iterative search of a binary search tree</i></font></font></b></pre>
<table width="740" cellspacing="0">
<tr>
<td width="541">
<pre><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000">tree_pointer <font color="#FF0000">search2</font>(tree_pointer tree,int key)
{ <i><font size="3" color="#CC0099">/* return a pointer to the node that contains key.
If there is no such node,return NULL. */ </font></i>
while (tree) {
if (key == tree->data) return tree;
if (key < tree->data)
tree = tree->left_child;
else
tree = tree->right_child;
}
return NULL;
} </font></b></pre>
</td>
<td width="193">
<pre><img src="IMAGE/text5-wb.gif" width="176" height="116"></pre>
</td>
</tr>
</table>
<pre align="left">
</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-32.htm">上一页</a>
<a href="text5-34.htm">下一页</a></b></font></td>
</tr>
</table>
<pre align="left">
</pre>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -