408数据结构代码模板修正版

<h3 id="408%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%BB%A3%E7%A0%81%E6%A8%A1%E6%9D%BF%E4%BF%AE%E6%AD%A3%E7%89%88"> </h3>
目录
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%BB%93%E7%82%B9%E5%AE%9A%E4%B9%89">二叉树的结点定义</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E6%99%AE%E9%80%9A%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%93%BE%E5%BC%8F%E5%AD%98%E5%82%A8%E7%BB%93%E7%82%B9%E5%AE%9A%E4%B9%89">普通二叉树的链式存储结点定义</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E7%BA%BF%E7%B4%A2%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%BB%93%E7%82%B9%E5%AE%9A%E4%B9%89">线索二叉树的结点定义</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E5%85%88%E5%BA%8F%E3%80%81%E4%B8%AD%E5%BA%8F%E3%80%81%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%EF%BC%88%E9%80%92%E5%BD%92%EF%BC%89">先序、中序、后序遍历（递归）</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86">层序遍历</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E5%85%88%E5%BA%8F%E9%81%8D%E5%8E%86%EF%BC%88%E9%9D%9E%E9%80%92%E5%BD%92%EF%BC%89">先序遍历（非递归）</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86%EF%BC%88%E9%9D%9E%E9%80%92%E5%BD%92%EF%BC%89">中序遍历（非递归）</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%EF%BC%88%E9%9D%9E%E9%80%92%E5%BD%92%EF%BC%89">后序遍历（非递归）</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E5%9B%BE%E7%9A%84%E5%AD%98%E5%82%A8%E7%BB%93%E6%9E%84">图的存储结构</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E9%82%BB%E6%8E%A5%E7%9F%A9%E9%98%B5%E7%9A%84%E7%BB%93%E7%82%B9%E5%AE%9A%E4%B9%89">邻接矩阵的结点定义</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E9%82%BB%E6%8E%A5%E8%A1%A8%E7%9A%84%E7%BB%93%E7%82%B9%E5%AE%9A%E4%B9%89">邻接表的结点定义</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E5%9B%BE%E7%9A%84%E9%81%8D%E5%8E%86%E6%96%B9%E5%BC%8FDFS%E5%92%8CBFS">图的遍历方式DFS和BFS</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95">排序算法</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E6%8A%98%E5%8D%8A%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F">折半插入排序</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E8%B5%B7%E6%B3%A1%E6%8E%92%E5%BA%8F">起泡排序</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F">快速排序</a>
<a href="https://blog.csdn.net/CJ_035/article/details/109331630#%E5%BD%92%E5%B9%B6%E7%AE%97%E6%B3%95">归并算法</a>
<hr id="hr-toc">
<h2 id="%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%BB%93%E7%82%B9%E5%AE%9A%E4%B9%89">二叉树的结点定义</h2>
<h3 id="%E6%99%AE%E9%80%9A%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%93%BE%E5%BC%8F%E5%AD%98%E5%82%A8%E7%BB%93%E7%82%B9%E5%AE%9A%E4%B9%89">普通二叉树的链式存储结点定义</h3>
<pre class="blockcode"><code class="language-cpp">typedef struct BTNode {
 char data; // 这里默认结点data域为char类型
 struct BTNode *lchild; // 左儿子
 struct BTNode *rchild; // 右儿子
}BTNode;</code></pre>
<h3 id="%E7%BA%BF%E7%B4%A2%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E7%BB%93%E7%82%B9%E5%AE%9A%E4%B9%89">线索二叉树

408数据结构代码模板修正版

浏览过的版块