'최대히프 삽입'에 해당되는 글 1건

#define MAX_ELEMENT 200
#define HEAP_FULL(n) (n == MAX_ELEMENT-1)
#define HEAP_EMPTY(n) (!n)
typedef struct{
 int key;
}element;

element heap[MAX_ELEMENT];
int n=0;

//최대 히프에 삽입
void insert_max_heap(element item, int* n){
 int i;
 if(HEAP_FULL(*n)){
  fprintf(stderr,"the heap is FULL\n");
  exit(1);
 }
 i=++(*n);
 while((i != 1) && (item.key > heap[i/2].key)){
  heap[i] = heap[i/2];
  i/=2;
 }
 heap[i] =item;
}

element delete_max_heap(int* n){
 int parent,child;
 element item,temp;
 if(HEAP_EMPTY(*n)){
  fprintf(stderr,"the heap is EMPTY\n");
  exit(1);
 }

 item=heap[1];
 temp=heap[(*n)--];
 parent = 1;
 child = 2;
 while(child <= *n){
  if(child< *n) && (heap[child].key) < heap[child+1].key
   child++;
  if(temp.key >= heap[child.key) break;

  heap[parent] =heap[child];
  parent=child;
  child* = 2;
 }
 heap[parent] = temp;
 return item;
}