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

Suppose that the level-order traversal sequence of a min-heap is {8, 38, 25, 58, 52, 82, 70, 60}. Use the linear algorithm to adjust this min-heap into a max-heap, and then run DeleteMax twice. The inorder traversal sequence of the resulting tree is: @[B](3)

A. 60, 58, 8, 52, 38, 25
B. 8, 58, 52, 60, 25, 38
C. 38, 58, 52, 60, 8, 25
D. 8, 58, 60, 32, 25, 38




A.60, 58, 8, 52, 38, 25
B.8, 58, 52, 60, 25, 38
C.38, 58, 52, 60, 8, 25
D.8, 58, 60, 32, 25, 38


答案：B