1 堆的概念及结构
如果有一个关键码的集合 K = { k 0 , k 1 , k 2 , . . . , k n − 1 } K = \{ k_0 , k_1 , k_2,...,k_{n-1} \} K={ k0,k1,k2,...,kn−1},把它的所有元素按照完全二叉树的顺序存储方式存储在一个一维数组中,并满足 K i < = K 2 i + 1 且 K i < = K 2 i + 2 , i = 0 , 1 , 2...... K_i <= K_{2i+1}且K_i <= K_{2i+2},i=0,1,2...... Ki<=K2i+1且Ki<=K2i+2,i=0,1,2......,则称为小堆,若满足 K i > =