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

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

A. 72, 42, 64, 36, 78, 38, 53
B. 72, 64, 42, 78, 53, 38, 36
C. 78, 64, 53, 72, 42, 38, 36
D. 53, 64, 38, 72, 78, 42, 36




A.72, 42, 64, 36, 78, 38, 53
B.72, 64, 42, 78, 53, 38, 36
C.78, 64, 53, 72, 42, 38, 36
D.53, 64, 38, 72, 78, 42, 36


答案：B