Implement the in-place heap-tree algorithm. To test it try:

insert(5, A), insert(4, B), insert(7, F), insert(1, D),

removeMin( ), insert(3, J), insert(6, L), removeMin( ),

removeMin( ), insert(8, G), removeMin( ), insert(2, H), removeMin( ),

removeMin( )?