单选题：Suppose that the level-order traversal sequence of a min-heap is

Suppose that the level-order traversal sequence of a min-heap is { 12, 27, 15, 84, 32, 18, 20 }. Use the linear algorithm to adjust this min-heap into a max-heap, and then call DeleteMax. The postorder traversal sequence of the resulting tree is: @[D](2)

A. 12, 18, 27, 15, 20, 32
B. 32, 27, 15, 12, 20, 18
C. 12, 18, 20, 15, 27, 32
D. 15, 12, 27, 18, 20, 32




A.12, 18, 27, 15, 20, 32
B.32, 27, 15, 12, 20, 18
C.12, 18, 20, 15, 27, 32
D.15, 12, 27, 18, 20, 32


答案：D