1.堆(heap) (1)堆的概念 若n个关键字序列 L [ 1... n ] L[1...n] L[1...n]满足下面某一条性质,则称为堆(heap) 堆 描述 大根堆 L ( i ) > = L ( 2 i ) L(i) >= L(2i) L(i)>=L(2i)且 L ( i ) > = L ( 2 i + 1 ) L(i) >= L(2i+1) L(i)>=L(2i+1) ( 1 < = i <