代码贴——堆（二叉树）数据结构

头文件Heap.h

#pragma once
#include
typedef int HPDataType;


typedef struct Heap
{
	HPDataType* a;
	int size;
	int capacity;
}HP;

void HPInit(HP* php);
void HPDestory(HP* php);
//出入后保持数据是堆
void HPPush(HP* php,HPDataType x);
HPDataType HPTop(HP* php);
//删除堆顶的数据
void HPPop(HP* php);
bool HPEmpty(HP* php);

源文件Heap.cpp

#include"Heap.h"
//物理上控制数组，逻辑上控制的是二叉树

void HPInit(HP* php)
{
	assert(php);
	php->a = NULL;
	php->size = 0;
	php->capacity = 0;
}


void HPDestory(HP* php)
{
	assert(php);
	free(php->a);
	php->a = NULL;
	php->size = 0;
	php->capacity = 0;
}

void Swap(HPDataType* px, HPDataType* py)
{
	HPDataType tmp = *px;
	*px = *py;
	*py = tmp;
}

//向上调整算法
void AdjustUp(HPDataType* a, int child)
{
	int parent = (child - 1) / 2;
	while (child>0)
	{
		if (a[child] < a[parent])
		{
			Swap(&a[child], &a[parent]);
			child = parent;
			parent = (parent - 1) / 2;
		}
		else
			break;
	}
}

//插入数据后，要调整大小堆，可能会影响祖先，不会影响兄弟
void HPPush(HP* php, HPDataType x)
{
	assert(php);
	//判断是否满，满则扩容
	if (php->size == php->capacity)
	{
		size_t newCapacity = php->capacity == 0 ? 4 : php->capacity * 2;
		HPDataType* tmp = (HPDataType *) realloc(php->a , sizeof(HPDataType)* newCapacity);
		if (tmp == NULL)
		{
			perror("realloc fail");
			return;
		}
		php->a = tmp;
		php->capacity = newCapacity;
	}
	php->a[php->size] = x;
	php->size++;
	AdjustUp(php->a,php->size-1);
}

//堆的最小值/最大值
HPDataType HPTop(HP* php)
{
	assert(php);

	return php->a[0];
}

void AdjustDown(HPDataType* a,int n,int parent)
{
	int child = parent * 2 + 1;
	while (childsize>0);
	Swap(&php->a[0], &php->a[php->size-1]);
	php->size--;
	AdjustDown(php->a, php->size,0);
}
bool HPEmpty(HP* php)
{
	assert(php);
	return php->size == 0;
}

测试文件Test.cpp

#include
#include"Heap.h"
using namespace std;
int main()
{
	int a[] = { 50,100,70,65,60,32 };
	HP hp;
	HPInit(&hp);
	for (int i = 0; i < sizeof(a) / sizeof(int); i++)
	{
		HPPush(&hp, a[i]);
	}

	/*cout << HPTop(&hp) << endl;
	HPPop(&hp);
	cout << HPTop(&hp) << endl;*/

	while (!HPEmpty(&hp))
	{
		cout << HPTop(&hp) << endl;
		HPPop(&hp);
	}

	HPDestory(&hp);
	return 0;
}