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

Suppose that the level-order traversal sequence of a max-heap is {98, 72, 86, 60, 65, 12, 23, 50}. Use the linear algorithm to adjust this max-heap into a min-heap, and then run DeleteMin twice. The inorder traversal sequence of the resulting tree is: @[B](3)

A. 50, 60, 98, 65, 72, 86
B. 98, 60, 65, 50, 86, 72
C. 98, 60, 50, 65, 86, 72
D. 72, 60, 65, 50, 98, 86




A.50, 60, 98, 65, 72, 86
B.98, 60, 65, 50, 86, 72
C.98, 60, 50, 65, 86, 72
D.72, 60, 65, 50, 98, 86


答案：B