xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-15 08:26:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-03-11 00:00:31 +08:00
parent d2f26f27b2
commit 93bb3267bb
5 changed files with 55 additions and 55 deletions
Download Patch File Download Diff File Expand all files Collapse all files
chapter_hashing/hash_map/index.html
+1 -1
View File
@@ -1733,7 +1733,7 @@
<li><strong>链表</strong>：每个结点的值为 <code>[学号, 姓名]</code> ；</li>
<li><strong>二叉搜索树</strong>：每个结点的值为 <code>[学号, 姓名]</code> ，根据学号大小来构建树；</li>
</ol>
<p>使用上述方法，各项操作的时间复杂度如下表所示（在此不做赘述，详解可见 <a href="https://www.hello-algo.com/chapter_tree/binary_search_tree/#_6">二叉搜索树章节</a>）。无论是查找元素、还是增删元素，哈希表的时间复杂度都是 <span class="arithmatex">\(O(1)\)</span> ，全面胜出！</p>
<p>使用上述方法，各项操作的时间复杂度如下表所示（在此不做赘述，详解可见 <a href="https://www.hello-algo.com/chapter_tree/binary_search_tree/">二叉搜索树章节</a>）。无论是查找元素、还是增删元素，哈希表的时间复杂度都是 <span class="arithmatex">\(O(1)\)</span> ，全面胜出！</p>
<div class="center-table">
<table>
<thead>