c语言 数组存储最小堆 删除堆顶元素[0,2,1,4,3,9,5,8,6,7]是以数组形式存储的最小堆,删除堆顶元素0后的结果是：A.[2,1,4,3,9,5,8,6,7]B.[1,2,5,4,3,9,8,6,7]C.[2,3,1,4,7,9,5,8,6]D.[1,2,5,4,3,9,7,8,6]

c语言 数组存储最小堆 删除堆顶元素[0,2,1,4,3,9,5,8,6,7]是以数组形式存储的最小堆,删除堆顶元素0后的结果是：A.[2,1,4,3,9,5,8,6,7]B.[1,2,5,4,3,9,8,6,7]C.[2,3,1,4,7,9,5,8,6]D.[1,2,5,4,3,9,7,8,6]
c语言 数组存储最小堆 删除堆顶元素
[0,2,1,4,3,9,5,8,6,7]是以数组形式存储的最小堆,删除堆顶元素0后的结果是：
A.[2,1,4,3,9,5,8,6,7]
B.[1,2,5,4,3,9,8,6,7]
C.[2,3,1,4,7,9,5,8,6]
D.[1,2,5,4,3,9,7,8,6]

c语言 数组存储最小堆 删除堆顶元素[0,2,1,4,3,9,5,8,6,7]是以数组形式存储的最小堆,删除堆顶元素0后的结果是：A.[2,1,4,3,9,5,8,6,7]B.[1,2,5,4,3,9,8,6,7]C.[2,3,1,4,7,9,5,8,6]D.[1,2,5,4,3,9,7,8,6]
D

0删除之后,7放到堆顶


然后经行堆调整

7和1交换


7再和5交换



所以序列就是125439786