List Implementation of Heap

#202202062259 could be implemented in #202110191729.

Analysis

Avoid sorting could achieve better performance
Insertion will result in \(O(1)\)
DeleteMin will result in \(O(N)\)

Links to this page

Priority Queue/Heap

Heap is a kind of #Queue that prioritise short tasks over long tasks. Its implementation could be based on tree# or list#.

#data-structure #heap #list