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

deploy

Browse Source
This commit is contained in:
krahets
2023-04-13 22:45:38 +08:00
parent df51fb3ba3
commit 68dc078761
5 changed files with 58 additions and 58 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
chapter_tree/binary_tree/index.html
View File

@@ -2241,8 +2241,8 @@
<li>完美二叉树是理想情况，可以充分发挥二叉树“分治”的优势；</li>
<li>链表则是另一个极端，各项操作都变为线性操作，时间复杂度退化至 <span class="arithmatex">\(O(n)\)</span> ；</li>
</ul>
<p><img alt="二叉树的最佳与最二叉树的最佳和最差结构差情况" src="../binary_tree.assets/binary_tree_corner_cases.png" /></p>
<p align="center"> Fig. 二叉树的最佳与最二叉树的最佳和最差结构差情况 </p>
<p><img alt="二叉树的最佳与最差结构" src="../binary_tree.assets/binary_tree_corner_cases.png" /></p>
<p align="center"> Fig. 二叉树的最佳与最差结构 </p>
<p>如下表所示，在最佳和最差结构下，二叉树的叶节点数量、节点总数、高度等达到极大或极小值。</p>
<div class="center-table">