Data Structure Notes
Max Heap
是一種binary tree結構，root一定會比leaf還要大，只要符合這個結構就是max-heap
適合用在實現Priority Queue資料結構以及HeapSort演算法
Priority Queue
需要滿足四種不同的operation
| Operation |
- INSERT(S,x)
Data Structure Notes
- Post link: https://bernie6401.github.io/Data-Structure-Notes/
- Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.