1 HEAP-MINIMUM(A) 2   return A[1] 3  4 HEAP-EXTRACT-MIN(A) 5   if A.heap-size < 1 6       error "heap underflow" 7   min = A[1] 8   A[1] = A[A.heap-size] 9   A.heap-size = A.heap-size - 110   MIN-HEAPIFY(A, 1)11   return min12 13 HEAP-DECREASE-KEY(A, i, key)14     if key > A[i]15         error "new key is biger than current key"16     A[i] = key17     while i < A.heap-size and A[PARENT(i)] > A[i]18         exchange A[i] and A[PARENT(i)]19         i = PARENT(i)20 21 MIN-HEAP-INSERT(A, key)22 A.heap-size = A.heap-size + 123 A[A.heap-size] = INT_MAX24 HEAP-DECREASE-KEY(A, A.heap-size, key)

 1 Input: A max-heap and an integers i 2 Output: The heap A with element a position i delete 3  4 A[i] = A[A.heap-size] 5 A.heap-size = A.heap-size - 1 6 key = A[i] 7 if key <= A[PARENT(i)] 8     MAX-HEAPIFY(A, i) 9 else10     while i > 1 and A.[PARENT(i)] < key11         A[i] = A[PARENT(i)]12         i = PARENT(i)13     A[i] = key