The potential function for queap Q will be where .

Insert(Q, x): The cost of the operation is O(1). The size of list L grows by one, the potential increases by some constant c.

Minimum(Q): The operation does not alter the data structure so the amortized cost is equal to its actual cost, O(1).

Delete(Q, x): There are two cases.

Case 1

If x is in tree T, then the amortized cost is not modified. The delete operation is O(1) amortized 2-4 tree. Since x was removed