text5-34.htm
来自「浙江大学计算机学院数据结构课程的教学课件」· HTM 代码 · 共 56 行
HTM
56 行
<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">(2)<font color="#FF0000"> Inserting into a binary search tree O(h)</font>
<img src="IMAGE/text5-x.gif" width="394" height="119">
void <font color="#FF0000">insert_node</font>(tree_pointer *node, int num)
<i><font size="3" color="#CC0099">/* If num is in the tree pointed at by node do nothing;otherwise add a new
node with data = num */
</font></i>{ tree_pointer ptr, temp = <font color="#FF0033">modified_search</font> (*node, num);
if ( temp || !(*node)){
<i><font size="3" color="#CC0099"> /*num is not in the tree */</font></i></font></b></pre>
<table width="765" cellspacing="0">
<tr>
<td width="561">
<pre><b><font face="Arial, Helvetica, sans-serif" size="4" color="#000000"><font size="3" color="#CC0099"><font size="4" color="#000000"> ptr = (tree_pointer) malloc (size</font></font><font size="4" color="#000000">of(node));
</font><font size="3" color="#CC0099"><font size="4" color="#000000"> </font></font><font size="4" color="#000000">if (IS_FULL( ptr )){</font>
fprintf (stderr,"The memory is full \n");
exit(1);
<font size="3" color="#CC0099"><font size="4" color="#000000"> </font></font>}
<font size="3" color="#CC0099"><font size="4" color="#000000"> </font></font>ptr->data = num;
<font size="3" color="#CC0099"><font size="4" color="#000000"> </font></font>ptr->left_child = ptr->right_child = NULL;
<font size="3" color="#CC0099"><font size="4" color="#000000"> </font></font>if (*node) <i><font size="3" color="#CC0099"> /* insert as child of temp */</font></i>
if (num < temp->data) temp->left_child = ptr;
else temp->right_child = ptr;
<font size="3" color="#CC0099"><font size="4" color="#000000"> </font></font>else *node = ptr;
}
}</font></b></pre>
</td>
<td width="206">
<pre><img src="IMAGE/text5-wc.gif" width="199" height="160"></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="text5-index.htm"></map></a></td>
<td width="131"><font face="楷体_GB2312" size="2"><b><a href="text5-33.htm">上一页</a>
<a href="text5-35.htm">下一页</a></b></font></td>
</tr>
</table>
<p> </p>
</body>
</html>
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?