建堆运算思路：

这里建堆采用向上调整，删除采用向下调整

建堆运算代码实现：

头文件：

#pragma
#include
#include
#includetypedef int HPDataType;
typedef struct heap
{int* a;int size;int capacity;
}HP;void Swap(HPDataType* px, HPDataType* py);//实现数组元素交换
void HeapInit(HP* hp);
void Heapdestory(HP* hp);
void HeapPush(HP* hp,HPDataType x);
void HeapPop(HP* hp);//删除堆顶数据
void HeapPrintf(HP* hp);

 源文件：

#include"heap.h"void Swap(HPDataType* px,HPDataType* py)
{HPDataType* tmp = *px;*px = *py;*py = tmp;
}void HeapInit(HP* hp)
{assert(hp);hp->a = NULL;hp->size = hp->capacity = 0;
}void Heapdestory(HP* hp)
{assert(hp);free(hp->a);hp->a = NULL;hp->size = hp->capacity = 0;
}//n为数组大小，child为新插入的数据位置
void AdjustUp(int *a,int n,int child)//向上调整
{assert(a);int parent = (child - 1) / 2;while (child>0){if (a[child] > a[parent]){//父子数值交换Swap(&a[child], &a[parent]);//更新父子结点child = parent;parent = (child - 1) / 2;}else{break;}}
}//堆插入数据堆其他结点没有影响
//可能会影响它到根节点的路径上的结点关系
void HeapPush(HP* hp, HPDataType x)//向上调整法
{assert(hp);if (hp->size==hp->capacity){size_t newcapacity = hp->capacity == 0 ? 4 : hp->capacity * 2;HPDataType* tmp = realloc(hp->a, sizeof(HPDataType) * newcapacity);if (tmp==NULL){printf("realloc fail\n");exit(-1);}hp->a = tmp;hp->capacity = newcapacity;}hp->a[hp->size] = x;hp->size++;AdjustUp(hp->a, hp->size, hp->size - 1);
}void AdjustDown(int *a,int n,int parent)
{assert(a);int child = parent * 2 + 1;while (childsize > 0);Swap(&hp->a[0], &hp->a[hp->size - 1]);hp->size--;AdjustDown(hp->a, hp->size,0);
}void HeapPrintf(HP* hp)
{for(int i=0;isize;i++){printf("%d ",hp->a[i]);}
}

测试：

#include"heap.h"int main()
{int a[] = { 70,56,30,25,15,10,75 };HP hp;HeapInit(&hp);for (int i=0;i