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

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

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



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


答案：A