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

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



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


答案：D