Daniel Okafor

Personal notes, min-heap version, array-backed with the root at index 1. - Parent of i: i / 2. Children of i: 2i and 2i + 1. - Add: put the new item at the end, then up-heap. Swap with the parent while it's smaller than the parent. - Remove: take the root, mov…