void heapify(int n, Node *_elem) { for ( int i = LastInternal ( n ); InHeap ( n, i ); i-- ) percolateDown(n, i, _elem); }
void PQ_ComplHeap<T>::heapify( Rank n ) { for (int i = LastInternal(n); i >= 0; i-- )//自下而上,依次 percolateDown(n, i);//下滤各内部节点 }//可理解为子堆的逐层合并