How would I code this up?

pop heap o Removing from a heap requires swapping the largest value with the bottom right most node and then bubbling down. Swap bottom right most node with root. Remove last node. 2 While current is not a leaf and (comp (left,current) or comp (right, current) is false): 3 if comp (left, right) is false, swap current and left 2 else swap current and right 3 compute new left and right