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

Suppose that the level-order traversal sequence of a min-heap is { 3, 8, 12, 65, 17, 26, 82 }. Use the linear algorithm to adjust this min-heap into a max-heap, and then call DeleteMax. The postorder traversal sequence of the resulting tree is:




A.65, 17, 8, 12, 26, 3
B.8, 12, 17, 3, 26, 65
C.3, 12, 17, 8, 26, 65
D.8, 17, 12, 65, 3, 26


答案：B