|
int *n)
{
int i, j;
element temp;
if(*n < 2){
fprintf(stderr, "The heap is empty\n");
deap[0].key = FALSE;
return deap[0];
}
deap[0] = deap[2];
temp = deap[(*n)--];
for(i=2 ; i*2 <= *n ; deap[i] = deap[j], i=j){
j = i*2;
if(j+1 <= *n){
if(deap[j].key > deap[j+1].key)
j++;
}
}
modified_de
|
|
|
Deap : public DEPQ<KeyType> {
public:
Deap (const int);
// ~Deap() {};
void Insert(const Element<KeyType>& x);
Element<KeyType>* DeleteMin(Element<KeyType>&);
Element<KeyType>* DeleteMax(Element<KeyType>&);
void display();
|
|
메뉴펼치기
