An almost-heap is a binary tree that satisfies all heap-properties except that at one item the order-property may be violated. Thus, it consists of an array A and one index i such that A[j]