Let n denote the number of elements currently in a data structure. An in-place heap is stored in the first n locations of an array, uses O(1) extra space, and supports the operations: minimum , insert , and extract -min. We introduce an in-place heap, for which minimum and insert take O(1) worst-case time, and extract -min takes O(lg n) worst-case time and involves at most lg n+O(1) element com...