堆--C语言描述

一. 定义

堆：一个特殊的完全二叉树

  (1.)大根堆：根结点的值大于或等于左右结点数据域的值。

（2.）小根堆：根结点的值小于或等于左右结点数据域的值。

二. 堆的创建

步骤：1.创建一个完全二叉树。

           2.调整成大（小）根堆。

 代码示例如下：此例的储存结构为数组

#include <stdio.h>
#include <stdlib.h>


void MySwap(int arr[], int a, int b)
{
	int temp = arr[a];
	arr[a] = arr[b];
	arr[b] = temp;
}
/*
	myArr 待调整的数组
	index 待调整的结点下标
	len	  数组的长度
*/
void HeapAdjust(int arr[], int index, int len)
{
	//先保存当前结点的下标
	int max = index;
	//保存左右孩子的下标
	int lchild = index * 2 + 1;
	int rchild = index * 2 + 2;
	if (lchild<len&&arr[lchild]>arr[max])
	{
		max = lchild;
	}
	if (rchild<len&&arr[rchild]>arr[max])
	{
		max = rchild;
	}
	if (max != index)
	{
		//交换两个结点
		MySwap(arr, max, index);
		HeapAdjust(arr, max, len);
	}
}

//堆排序
void HeapSort(int myArr[], int len)
{
	//初始化堆
	for (int i = len / 2 - 1; i >= 0; i--)
	{
		HeapAdjust(myArr, i, len);
	}
	//交换堆顶元素和最后一个元素
	for (int i = len / 2 - 1; i >= 0; i--)
	{
		MySwap(myArr, 0, i);
		HeapAdjust(myArr, 0, i);
	}
}
void PrintArray(int arr[], int len)
{
	for (int i = 0; i < len; i++)
	{
		printf("%d ", arr[i]);
	}
}

int main(void)
{
	int myArr[] = { 4,2,8,0,5,7,1,3,9 };
	int len = sizeof(myArr) / sizeof(int);
	//堆排序
	HeapSort(myArr, len);
	PrintArray(myArr,len);
}

此例的储存结构为链表

#include <stdio.h>
#include <stdlib.h>
typedef struct node {
	int Date;
	struct node * left, * right;
}HeapNode;

HeapNode *  CreateTree(int Date[], int n, HeapNode ** Q)
{
	HeapNode * root = 0, *cp, *newp;
	int front, rear, pa = 1;
	front = rear = 0;
	for (int i = 0; i < n; i++)
	{
		newp = (HeapNode *)malloc(sizeof(HeapNode));
		newp->Date= Date[i];
		newp->right = newp->left = NULL;
		if (!root)
			root = newp;
		else
		{
			cp = Q[pa];
			if (!cp->left)
				cp->left = newp;
			else
			{
				cp->right = newp;
				pa++;
			}
		}
		Q[++rear] = newp;
	}
	return root;
}

void LevelOrder(HeapNode * r)
{
	HeapNode **s;
	HeapNode *p;
	int front, rear;
	//创建队列
	s = (HeapNode **)malloc(100 * sizeof(HeapNode*));
	//初始化
	front = rear = 0;
	s[++rear] = r;
	//按层非递归
	while (front != rear)
	{
		p = s[++front];
		printf("%d ", p->Date);
		if (p->left)
			s[++rear] = p->left;
		if (p->right)
			s[++rear] = p->right;
	}
	free(s);
}



int main(void)
{
	int * Date;
	HeapNode * root;
	HeapNode ** Q;
	int n;
	printf("有多少个数据？");
	scanf("%d", &n);
	//创建数据集合
	Date = (int *)malloc(n*sizeof(int));
	//初始化
	for (int i = 0; i < 0; i++)
		scanf("%d", Date[i]);
	//创建完全二叉树
	root = CreateTree(Date, n, Q);
	//遍历输出
	LevelOrder(root);
	
}