Skip to content

[pull] master from Snailclimb:master #214

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pull merged 2 commits into from
Oct 6, 2021
+3 −3
Merged

[pull] master from Snailclimb:master #214

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
abd8907
Update 堆.md
Masker99 Oct 4, 2021
8023698
Merge pull request #1426 from Masker99/master
Snailclimb Oct 6, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions docs/cs-basics/data-structure/堆.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@
- 很多博客说堆是完全二叉树，其实并非如此，**堆不一定是完全二叉树**，只是为了方便存储和索引，我们通常用完全二叉树的形式来表示堆，事实上，广为人知的斐波那契堆和二项堆就不是完全二叉树,它们甚至都不是二叉树。
- （**二叉**）堆是一个数组，它可以被看成是一个 **近似的完全二叉树**。——《算法导论》第三版

大家可以尝试判断下面给出的图是否是二叉树？
大家可以尝试判断下面给出的图是否是堆？

![](pictures/堆/堆1.png)

Expand All @@ -40,7 +40,7 @@


## 堆的存储
之前介绍树的时候说过，由于完全二叉树的优秀性质，利用数组存储二叉树即节省空间，又方便索引（若根结点的序号为1，那么对于树中任意节点i，其左子节点序号为 `2\*i`，右子节点序号为 `2\*i+1`）。
之前介绍树的时候说过，由于完全二叉树的优秀性质，利用数组存储二叉树即节省空间，又方便索引（若根结点的序号为1，那么对于树中任意节点i，其左子节点序号为 `2*i`，右子节点序号为 `2*i+1`）。

为了方便存储和索引，（二叉）堆可以用完全二叉树的形式进行存储。存储的方式如下图所示：

Expand Down Expand Up @@ -189,4 +189,4 @@

![堆排序6](pictures/堆/堆排序6.png)

堆排序完成！
堆排序完成！