二叉树与堆排序

1、简单二叉树的创建与遍历

遍历：先序遍历、中序遍历、后续遍历

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

struct node
{
	int data;
	struct node *right, *left;
};
typedef struct node TreeNode;

TreeNode *CreateTree(int *a)
{
	int i;
	TreeNode *node[11] = {0};

	for (i = 0; i < 10; i++)
	{
		node[i] = (TreeNode *)malloc(sizeof(TreeNode));
		if (NULL == node[i])
		{
			printf("malloc error!\n");
		}

		node[i]->data = a[i];
		node[i]->right = NULL;
		node[i]->left = NULL;
	}

	for (i = 0; i < 10 / 2; i++)
	{
		node[i]->left = node[2 * i + 1];
		node[i]->right = node[2 * i + 2];
	}

	return node[0];
}

int PreOrder(TreeNode *T)
{
	if(T == NULL)
	{
		return 1;
	}

	printf("%d ", T->data);
	PreOrder(T->left);
	PreOrder(T->right);

	return 0;
}

int InOrder(TreeNode *T)
{
	if(T == NULL)
	{
		return 1;
	}

	InOrder(T->left);
	printf("%d ", T->data);
	InOrder(T->right);

	return 0;
}

int PostOrder(TreeNode *T)
{
	if(T == NULL)
	{
		return 1;
	}

	PostOrder(T->left);
	PostOrder(T->right);
	printf("%d ", T->data);

	return 0;
}


int main()
{
	int a[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0};
	TreeNode *root;

	root = CreateTree(a);
	PreOrder(root);
	printf("\n");
	InOrder(root);
	printf("\n");
	PostOrder(root);
	return 0;
}

2、堆排序

#include <stdio.h>
//数据量小的时候构建堆浪费时间，数据量大时候用
void AdjustMinHeap(int *a, int pos, int len)
{//                数组名   
	int temp;
	int child;

	for (temp = a[pos]; 2 * pos + 1 <= len; pos = child)
	{
		child = 2 * pos + 1;     
		if (child < len && a[child] > a[child + 1])
		{
			child++;
		}
		if (a[child] < temp)
		{
			a[pos] = a[child];
		}
		else
		{
			break;
		}
	}
	a[pos] = temp;
}

void Swap(int *a, int *b)
{
	int temp;
	temp = *a;
	*a = *b;
	*b = temp;
}

void PrintArray(int *a, int length)
{
	int i;

	for (i = 0; i < length; i++)
	{
		printf("%d ", a[i]);
	}
	printf("\n");
}

void HeapSort(int *array, int len)
{
	int i;

	for (i = len / 2 - 1; i >= 0; i--)  
	{ //i是非叶子结点的下标
		AdjustMinHeap(array, i, len - 1);//调整小顶堆
	}
	for (i = len -1; i >= 0; i--)
	{
		Swap(&array[0], &array[i]);
		AdjustMinHeap(array, 0, i - 1);
	}
}

int main()
{
	int array[] = {0, 13, 1, 14, 27, 18};
	int length = sizeof(array) / sizeof(array[0]);

	HeapSort(array, length);
	PrintArray(array, length);

	return 0;
}