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

Suppose that the level-order traversal sequence of a min-heap is { 2, 17, 5, 46, 22, 8, 10 }. 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:

@[C](3)

A. 2, 8, 17, 5, 10, 22
B. 22, 17, 5, 2, 10, 8
C. 5, 2, 17, 8, 10, 22
D. 2, 8, 10, 5, 17, 22



A.2, 8, 17, 5, 10, 22
B.22, 17, 5, 2, 10, 8
C.5, 2, 17, 8, 10, 22
D.2, 8, 10, 5, 17, 22


答案：C