algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add captions for all the animations.

Browse Source
This commit is contained in:
krahets
2023-02-26 19:22:46 +08:00
parent 7aa44d212c
commit 23cda5e225
13 changed files with 20 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
docs/chapter_heap/heap.md
View File

@@ -487,7 +487,7 @@
考虑从入堆结点开始，**从底至顶执行堆化**。具体地，比较插入结点与其父结点的值，若插入结点更大则将它们交换；并循环以上操作，从底至顶地修复堆中的各个结点；直至越过根结点时结束，或当遇到无需交换的结点时提前结束。
=== "<1>"
![heap_push_step1](heap.assets/heap_push_step1.png)
![元素入堆步骤](heap.assets/heap_push_step1.png)
=== "<2>"
![heap_push_step2](heap.assets/heap_push_step2.png)
@@ -597,7 +597,7 @@
顾名思义，**从顶至底堆化的操作方向与从底至顶堆化相反**，我们比较根结点的值与其两个子结点的值，将最大的子结点与根结点执行交换，并循环以上操作，直到越过叶结点时结束，或当遇到无需交换的结点时提前结束。
=== "<1>"
![heap_poll_step1](heap.assets/heap_poll_step1.png)
![堆顶元素出堆步骤](heap.assets/heap_poll_step1.png)
=== "<2>"
![heap_poll_step2](heap.assets/heap_poll_step2.png)