Data Structures · topic
Binary heap array indexing, insertion and deletion with sift-up and sift-down traces, heap property checks, bottom-up build-heap in linear time, where the k-th smallest key can sit, counting heaps, and d-ary heaps.
A binary heap is a complete binary tree, stored in an array, in which every parent is at least as large as its children (a max-heap) or at most as large (a min-heap)." The answer sits at the root, and the structure can be repaired in O(lg n) time after an insertion or a removal.
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.
