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

Suppose that the level-order traversal sequence of a max-heap is {64, 53, 45, 36, 48, 27}. Use the linear algorithm to adjust this max-heap into a min-heap, and then insert 32. The postorder traversal sequence of the resulting tree is: @[A](2)

A. 53, 48, 36, 64, 45, 32, 27
B. 53, 36, 48, 27, 64, 32, 45
C. 64, 48, 45, 53, 36, 32, 27
D. 45, 48, 32, 53, 64, 36, 27




A.53, 48, 36, 64, 45, 32, 27
B.53, 36, 48, 27, 64, 32, 45
C.64, 48, 45, 53, 36, 32, 27
D.45, 48, 32, 53, 64, 36, 27


答案：A