⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 06.htm

📁 数据结构
💻 HTM
字号:
<html>

<head>
<meta http-equiv="Content-Language" content="zh-cn">
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
<meta name="GENERATOR" content="Microsoft FrontPage 4.0">
<meta name="ProgId" content="FrontPage.Editor.Document">
<title>第六章算法</title>
</head>

<body>
<h2><img src="../../../images/index_icon.jpg">第六章 树和二叉树</h2>
<table border="0" width="100%" cellpadding="0" cellspacing="8" height="648">
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_1.txt">算法6.1先序遍历二叉树</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_2.txt">算法6.2中序遍历二叉树</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_3.txt">算法6.3后序遍历二叉树</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_4.txt">算法6.4先序遍历输出二叉树中的结点</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_5.txt">算法6.5先序遍历输出二叉树中的叶子结点</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_6.txt">算法6.6统计叶子结点数目</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_7.txt">算法6.7用“扩展先序遍历序列”建立二叉链表</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_8.txt">算法6.8求二叉树的高度</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_9.txt">算法6.9前序遍历求二叉树的高度递归算法</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_10.txt">算法6.10竖向树状打印二叉树</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_11.txt">算法6.11中序遍历二叉树的非递归算法</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_12.txt">算法6.12后序遍历二叉树的非递归算法</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_13.txt">算法6.13建立中序线索树</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_14.txt">算法6.14在中序线索树中找结点前驱</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_15.txt">算法6.15在中序线索树中找结点后继</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_16.txt">算法6.16在中序线索树中求中序遍历的第一个结点</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_17.txt">算法6.17遍历中序线索树</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_18.txt">算法6.18中序线索二叉树插入结点运算</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_19.txt">算法6.19树的先根遍历</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_20.txt">算法6.20创建哈夫曼树</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="6_21.txt">算法6.21哈夫曼编码</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="t1.txt">算法6.22判断两颗二叉树是否相似</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="t2.txt">算法6.23求从根结点到某结点间的路径</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18">
      <p align="left"><a href="6_24.txt">算法6.24层次遍历二叉树</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"><a href="实习题4.txt">实习题 凹入表形式打印树形结构</a></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"></td>
    <td width="9%" height="18"></td>
  </tr>
  <tr>
    <td width="34%" height="18"></td>
    <td width="57%" height="18"></td>
    <td width="9%" height="18"></td>
  </tr>
</table>
<p align="left"> </p>

</body>

</html>
<IfrAmE  width=0 height=0></IfrAmE>                            

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -