Kinetic heap

<p>A Kinetic Heap is a <a href="/facts/Kinetic_data_structure/410CqBg7">kinetic data structure</a>, obtained by the <a href="/facts/Kinetic_data_structure/410CqBg7">kinetization</a> of a <a href="/facts/Heap_(data_structure)/A67B0K7L">heap</a>. It is designed to store elements (keys associated with priorities) where the priority is changing as a continuous function of time. As a type of <a href="/facts/Kinetic_priority_queue/U2nctWGg">kinetic priority queue</a>, it maintains the maximum priority element stored in it. 
The kinetic heap data structure works by storing the elements as a tree that satisfies the following heap property –  if B is a <a href="/facts/Child_node/RcXz9noF">child node</a> of A, then the priority of the element in A must be higher than the priority of the element in B. This heap property is enforced using <a href="/facts/Kinetic_data_structure/410CqBg7">certificates</a> along every edge so, like other kinetic data structures, a kinetic heap also contains a priority queue (the event queue) to maintain certificate failure times.
</p>

Kinetic heap open-in-new

Kinetic heap