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

deploy

Browse Source
This commit is contained in:
krahets
2023-08-20 14:52:42 +08:00
parent 96fded547b
commit 26a2e7f171
42 changed files with 234 additions and 230 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
chapter_tree/binary_search_tree/index.html
View File

@@ -4900,7 +4900,7 @@ void insert(int num) {
</div>
<h3 id="4">4. &nbsp; 排序<a class="headerlink" href="#4" title="Permanent link">&para;</a></h3>
<p>我们知道，二叉树的中序遍历遵循“左 <span class="arithmatex">\(\rightarrow\)</span> 根 <span class="arithmatex">\(\rightarrow\)</span> 右”的遍历顺序，而二叉搜索树满足“左子节点 <span class="arithmatex">\(&lt;\)</span> 根节点 <span class="arithmatex">\(&lt;\)</span> 右子节点”的大小关系。因此，在二叉搜索树中进行中序遍历时，总是会优先遍历下一个最小节点，从而得出一个重要性质：<strong>二叉搜索树的中序遍历序列是升序的</strong>。</p>
<p>利用中序遍历升序的性质，我们在二叉搜索树中获取有序数据仅需 <span class="arithmatex">\(O(n)\)</span> 时间，无需额外排序，非常高效。</p>
<p>利用中序遍历升序的性质，我们在二叉搜索树中获取有序数据仅需 <span class="arithmatex">\(O(n)\)</span> 时间，无须额外排序，非常高效。</p>
<p><img alt="二叉搜索树的中序遍历序列" src="../binary_search_tree.assets/bst_inorder_traversal.png" /></p>
<p align="center"> 图：二叉搜索树的中序遍历序列 </p>