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

📄 contents.html

📁 介绍各种数据结构的讲义
💻 HTML
字号:

<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML//EN">
<html><!-- #BeginTemplate "/Templates/content_template.dwt" -->
<head>
<!-- #BeginEditable "doctitle" --> 
<title>算法与数据结构——数据结构</title>
<!-- #EndEditable -->
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
<script src="../lib/tree.js">
</script>
<link rel="stylesheet" href="../css/contents.css" type="text/css">
<script>
<!--
leaf_img="../images/dc.gif";   //叶节点图片
branch_close_img="../images/bs.gif"; //分支关闭时的图片
branch_open_img="../images/bo.gif";  //分支打开时的图片
indent=20;  //缩近20px;
//-->
</script>
<base target="fraTopic">
</head>
<BODY style="margin-top:10px;margin-bottom:0px;margin-right:0px;" bgcolor="#FFFFFF" onload="init()">
<div id="tree" style="margin-left:-40px;">
<!-- #BeginEditable "main" --> 
<ul style="margin-left:25px;">
  <li> <a href="main.html">数据结构</a>
  <ul>
  <li><a href="defination.html">何谓数据结构</a></li>
  <li><a href="dataexpr.html">计算机中数据的描述方式</a></li>
  <li><a href="ADT/index.htm">算法表达中的抽象机制 </a> 
    <ul>
      <li><a href="ADT/introduction.htm">简介</a></li>
      <li><a href="ADT/chapter1.htm">从机器语言到高级语言的抽象</a></li>
      <li><a href="ADT/chapter2.htm">抽象数据类型</a></li>
      <li><a href="ADT/chapter3.htm">使用抽象数据类型带来的好处</a></li>
      <li><a href="ADT/chapter4.htm">数据结构、数据类型和抽象数据类型</a></li>
    </ul>
  </li>
  <li><a href="basic/index.html">基本ADT </a> 
    <ul>
      <li><a href="javascript:{}">表 </a> 
        <ul>
          <li><a href="basic/list/chapter1.htm">表的定义和性质</a></li>
          <li><a href="basic/list/chapter2.htm">ADT表的操作</a></li>
          <li><a href="basic/list/chapter3.htm">表的实现 </a> 
            <ul>
              <li><a href="basic/list/chapter3_1.htm">表的数组实现</a></li>
              <li><a href="basic/list/chapter3_2.htm">表的指针实现</a></li>
              <li><a href="basic/list/chapter3_3.htm">表的游标实现</a></li>
              <li><a href="basic/list/chapter3_4.htm">循环链表</a></li>
              <li><a href="basic/list/chapter3_5.htm">双链表</a></li>
            </ul>
          </li>
          <li><a href="basic/list/chapter4.htm">表的应用</a></li>
        </ul>
      </li>
      <li><a href="javascript:{}">栈 </a> 
        <ul>
          <li><a href="basic/stack/chapter1.htm">栈的定义和性质</a></li>
          <li><a href="basic/stack/chapter2.htm">ADT栈的操作</a></li>
          <li><a href="basic/stack/chapter3.htm">栈的实现 </a> 
            <ul>
              <li><a href="basic/stack/chapter3_1.htm">栈的数组实现</a></li>
              <li><a href="basic/stack/chapter3_2.htm">栈的指针实现</a></li>
            </ul>
          </li>
          <li><a href="basic/stack/chapter4.htm">栈的应用</a></li>
        </ul>
      </li>
      <li><a href="javascript:{}">队列 </a> 
        <ul>
          <li><a href="basic/queue/chapter1.htm">队列的定义和性质</a></li>
          <li><a href="basic/queue/chapter2.htm">ADT队列的操作</a></li>
          <li><a href="basic/queue/chapter3.htm">队列的实现 </a> 
            <ul>
              <li><a href="basic/queue/chapter3_1.htm">用循环数组实现队列</a></li>
              <li><a href="basic/queue/chapter3_2.htm">用指针实现队列</a></li>
            </ul>
          </li>
          <li><a href="basic/queue/chapter4.htm">队列的应用</a></li>
        </ul>
      </li>
      <li>串</li>
      <li><a href="javascript:{}">树</a> 
        <ul>
          <li><a href="basic/tree/chapter1.htm">树的定义</a></li>
          <li><a href="basic/tree/chapter2.htm">树的相关术语</a></li>
          <li><a href="basic/tree/chapter3.htm">树的数学定义</a></li>
          <li><a href="basic/tree/chapter4.htm">ADT树的操作</a></li>
          <li><a href="basic/tree/chapter5.htm">树的遍历</a></li>
          <li><a href="basic/tree/chapter6.htm">树的实现 </a> 
            <ul>
              <li><a href="basic/tree/chapter6_1.htm">父亲数组表示法</a></li>
              <li><a href="basic/tree/chapter6_2.htm">儿子链表表示法</a></li>
              <li><a href="basic/tree/chapter6_3.htm">左儿子右兄弟表示法</a></li>
            </ul>
          </li>
          <li><a href="basic/tree/chapter7.htm">树的应用</a></li>
        </ul>
      </li>
      <li><a href="javascript:{}">二叉树 </a> 
        <ul>
          <li><a href="basic/binary_tree/chapter1.htm">二叉树的定义</a></li>
          <li><a href="basic/binary_tree/chapter2.htm">二叉树的数学性质</a></li>
          <li><a href="basic/binary_tree/chapter3.htm">特殊形态的二叉树</a></li>
          <li><a href="basic/binary_tree/chapter4.htm">ADT二叉树的操作</a></li>
          <li><a href="basic/binary_tree/chapter5.htm">二叉树的实现 </a> 
            <ul>
              <li><a href="basic/binary_tree/chapter5_1.htm">二叉树的顺序存储结构</a></li>
              <li><a href="basic/binary_tree/chapter5_2.htm">二叉树的结点度表示法</a></li>
              <li><a href="basic/binary_tree/chapter5_3.htm">二叉树的链式存储结构</a></li>
              <li><a href="basic/binary_tree/chapter5_4.htm">线索二叉树</a></li>
            </ul>
          </li>
          <li><a href="basic/binary_tree/chapter6.htm">二叉树的应用 </a> 
            <ul>
              <li><a href="basic/binary_tree/chapter6_1.htm">果园或森林的二叉树表示</a></li>
            </ul>
          </li>
        </ul>
      </li>
      <li>图</li>
    </ul>
  </li>
      <li><a href="advanced/index.html">高级ADT </a>
<ul>
      <li>集合</li>
      <li>字典</li>
      <li>散列表</li>
      <li>有序字典</li>
      <li>并查集</li>
      <li>优先队列</li>
      <li>优先级树和堆 
        <ul>
          <li>二项堆</li>
          <li>Fibonacci 堆</li>
        </ul>
      </li>
      <li>检索树</li>
      <li>搜索树 
        <ul>
          <li>二叉搜索树</li>
          <li>平衡搜索树 
            <ul>
              <li>红黑树</li>
              <li>2-3树</li>
              <li>B- 树</li>
            </ul>
          </li>
        </ul>
      </li>
      <li>分离集合</li>
    </ul>
  </li>
 </ul>
 </li>
</ul>
<!-- #EndEditable --> 
</div>
</body>
<script>
document.body.noWrap=true;
//to add title
var acol=document.body.all.tags("A");
if (acol!=null)
	for (var i=0;i<acol.length;i++)
		acol[i].title=acol[i].innerText;
</script>
<!-- #EndTemplate --></html>

⌨️ 快捷键说明

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