Heap and Huffman tree (data structure: under the tree by Zhejiang University mooc)

Heap Priority queue: for a special queue, the order of taking out elements is based on the priority (keyword) size of elements, not the order in which elements enter the queue The priority queue is realized by array or linked list Array: Insert, element always inserts tail O(1)Delete, find the maximum (or minimum) keyword O(n), and delete t ...

Posted on Sun, 10 Oct 2021 08:36:00 -0400 by Canman2005