CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 18:00:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-08-20 13:37:20 +08:00
parent 88e0b11361
commit 96fded547b
35 changed files with 777 additions and 716 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
chapter_tree/binary_tree/index.html
View File

@@ -1403,29 +1403,29 @@
<ul class="md-nav__list">
<li class="md-nav__item">
<a href="#_1" class="md-nav__link">
完美二叉树
<a href="#1" class="md-nav__link">
1. &nbsp; 完美二叉树
</a>
</li>
<li class="md-nav__item">
<a href="#_2" class="md-nav__link">
完全二叉树
<a href="#2" class="md-nav__link">
2. &nbsp; 完全二叉树
</a>
</li>
<li class="md-nav__item">
<a href="#_3" class="md-nav__link">
完满二叉树
<a href="#3" class="md-nav__link">
3. &nbsp; 完满二叉树
</a>
</li>
<li class="md-nav__item">
<a href="#_4" class="md-nav__link">
平衡二叉树
<a href="#4" class="md-nav__link">
4. &nbsp; 平衡二叉树
</a>
</li>
@@ -3445,29 +3445,29 @@
<ul class="md-nav__list">
<li class="md-nav__item">
<a href="#_1" class="md-nav__link">
完美二叉树
<a href="#1" class="md-nav__link">
1. &nbsp; 完美二叉树
</a>
</li>
<li class="md-nav__item">
<a href="#_2" class="md-nav__link">
完全二叉树
<a href="#2" class="md-nav__link">
2. &nbsp; 完全二叉树
</a>
</li>
<li class="md-nav__item">
<a href="#_3" class="md-nav__link">
完满二叉树
<a href="#3" class="md-nav__link">
3. &nbsp; 完满二叉树
</a>
</li>
<li class="md-nav__item">
<a href="#_4" class="md-nav__link">
平衡二叉树
<a href="#4" class="md-nav__link">
4. &nbsp; 平衡二叉树
</a>
</li>
@@ -3953,7 +3953,7 @@
<p>需要注意的是，插入节点可能会改变二叉树的原有逻辑结构，而删除节点通常意味着删除该节点及其所有子树。因此，在二叉树中，插入与删除操作通常是由一套操作配合完成的，以实现有实际意义的操作。</p>
</div>
<h2 id="713">7.1.3 &nbsp; 常见二叉树类型<a class="headerlink" href="#713" title="Permanent link">&para;</a></h2>
<h3 id="_1">完美二叉树<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h3>
<h3 id="1">1. &nbsp; 完美二叉树<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
<p>「完美二叉树 Perfect Binary Tree」除了最底层外，其余所有层的节点都被完全填满。在完美二叉树中，叶节点的度为 <span class="arithmatex">\(0\)</span> ，其余所有节点的度都为 <span class="arithmatex">\(2\)</span> ；若树高度为 <span class="arithmatex">\(h\)</span> ，则节点总数为 <span class="arithmatex">\(2^{h+1} - 1\)</span> ，呈现标准的指数级关系，反映了自然界中常见的细胞分裂现象。</p>
<div class="admonition tip">
<p class="admonition-title">Tip</p>
@@ -3962,17 +3962,17 @@
<p><img alt="完美二叉树" src="../binary_tree.assets/perfect_binary_tree.png" /></p>
<p align="center"> 图：完美二叉树 </p>
<h3 id="_2">完全二叉树<a class="headerlink" href="#_2" title="Permanent link">&para;</a></h3>
<h3 id="2">2. &nbsp; 完全二叉树<a class="headerlink" href="#2" title="Permanent link">&para;</a></h3>
<p>「完全二叉树 Complete Binary Tree」只有最底层的节点未被填满，且最底层节点尽量靠左填充。</p>
<p><img alt="完全二叉树" src="../binary_tree.assets/complete_binary_tree.png" /></p>
<p align="center"> 图：完全二叉树 </p>
<h3 id="_3">完满二叉树<a class="headerlink" href="#_3" title="Permanent link">&para;</a></h3>
<h3 id="3">3. &nbsp; 完满二叉树<a class="headerlink" href="#3" title="Permanent link">&para;</a></h3>
<p>「完满二叉树 Full Binary Tree」除了叶节点之外，其余所有节点都有两个子节点。</p>
<p><img alt="完满二叉树" src="../binary_tree.assets/full_binary_tree.png" /></p>
<p align="center"> 图：完满二叉树 </p>
<h3 id="_4">平衡二叉树<a class="headerlink" href="#_4" title="Permanent link">&para;</a></h3>
<h3 id="4">4. &nbsp; 平衡二叉树<a class="headerlink" href="#4" title="Permanent link">&para;</a></h3>
<p>「平衡二叉树 Balanced Binary Tree」中任意节点的左子树和右子树的高度之差的绝对值不超过 1 。</p>
<p><img alt="平衡二叉树" src="../binary_tree.assets/balanced_binary_tree.png" /></p>
<p align="center"> 图：平衡二叉树 </p>