数据结构——二叉树

#pragma once
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<string.h>
#include"Queue.h"
typedef char DataType;
typedef struct TreeNode{
	struct TreeNode *pleft;
	struct TreeNode *pright;
	DataType data;
}TreeNode;
TreeNode *CreateRoot(DataType data)
{
	TreeNode *pRoot = (TreeNode*)malloc(sizeof(TreeNode));
	assert(pRoot);
	pRoot->data = data;
	pRoot->pleft = NULL;
	pRoot->pright = NULL;
	return pRoot;
}
//创建树
TreeNode * CreateTree(DataType preOrder[], int size, int *pIndex)
{
	if (*pIndex >= size)
	{
		return NULL;
	}
	if (preOrder[*pIndex] == '#')
	{
		*pIndex += 1;
		return NULL;
	}
	TreeNode *pRoot = CreateRoot(preOrder[*pIndex]);
	*pIndex += 1;
	pRoot->pleft = CreateTree(preOrder, size, pIndex);
	pRoot->pright = CreateTree(preOrder, size, pIndex);
	return pRoot;
}
//前序，递归
void PreOrder(TreeNode *pRoot)
{
	if (pRoot == NULL)
	{
		return NULL;
	}
	printf("%c ", pRoot->data);
	PreOrder(pRoot->pleft);
	PreOrder(pRoot->pright);
}
//中序，递归
void InOrder(TreeNode *pRoot)
{
	if (pRoot == NULL)
	{
		return NULL;
	}
	PreOrder(pRoot->pleft);
	printf("%c ",pRoot->data);
	PreOrder(pRoot->pright);
}
//后序，递归
void PostOrder(TreeNode *pRoot)
{
	if (pRoot == NULL)
	{
		return NULL;
	}
	PreOrder(pRoot->pleft);
	PreOrder(pRoot->pright);
	printf("%c ",pRoot->data);
}
//结点个数
int GetSize(TreeNode *pRoot)
{
	if (pRoot == NULL)
	{
		return 0;
	}
	return GetSize(pRoot->pleft) + GetSize(pRoot->pright)+1;
}
//叶子结点数
int GetLeafSize(TreeNode *pRoot)
{
	if (pRoot == NULL)
	{
		return 0;
	}
	if (pRoot->pleft == NULL&&pRoot->pright == NULL)
	{
		return 1;
	}
	return GetLeafSize(pRoot->pleft) + GetLeafSize(pRoot->pright);
}
//第k层结点个数
int GetKLevelSize(TreeNode *pRoot, int k)
{
	assert(k >= 1);
	if (pRoot == NULL) {
		return 0;
	}
	if (k == 1) {
		return 1;
	}
	return GetKLevelSize(pRoot->pleft, k - 1)
		+ GetKLevelSize(pRoot->pright, k - 1);
}
//判断一个结点是否在树中
TreeNode * Find(TreeNode *pRoot, DataType data)
{
	assert(pRoot);
	if (pRoot == NULL)
	{
		return NULL;
	}
	if (pRoot->data == data)
	{
		return pRoot;
	}
	TreeNode *pFound = Find(pRoot->pleft, data);
	if (pFound != NULL)
	{
		return pFound;
	}
	return Find(pRoot->pright, data);
}
//求树的高度
#define MAX(X,Y)  ((X)>(Y))?X:Y
int GetHeight(TreeNode *pRoot)
{
	if (pRoot == NULL)
	{
		return 0;
	}
	if (pRoot->pleft==NULL&&pRoot->pright == NULL)
	{
		return 1;
	}
	int left = GetHeight(pRoot->pleft);
	int right = GetHeight(pRoot->pright);
	return MAX(left, right) + 1;
}
void LevelOrder(TreeNode *pRoot)
{
	if (pRoot == NULL) {
		printf("\n");
		return;
	}

	Queue	queue;
	TreeNode *pFront;
	QueueInit(&queue);
	QueuePush(&queue, pRoot);

	while (!QueueIsEmpty(&queue)) {
		pFront = QueueFront(&queue);
		QueuePop(&queue);

		printf("%c ", pFront->data);
		if (pFront->pleft != NULL) {
			QueuePush(&queue, pFront->pleft);
		}
		if (pFront->pright != NULL) {
			QueuePush(&queue, pFront->pright);
		}
	}

	printf("\n");
}
//判断是否完全二叉树
int IsComplete(TreeNode *pRoot)
{
	if (pRoot == NULL) {
		return 1;
	}
	Queue	queue;
	TreeNode *pFront;
	QueueInit(&queue);
	QueuePush(&queue, pRoot);

	while (!QueueIsEmpty(&queue)) {
		pFront = QueueFront(&queue);
		QueuePop(&queue);
		if (pFront == NULL) {
			break;
		}

		QueuePush(&queue, pFront->pleft);
		QueuePush(&queue, pFront->pright);
	}

	while (!QueueIsEmpty(&queue)) {
		pFront = QueueFront(&queue);
		QueuePop(&queue);

		if (pFront != NULL) {
			return 0;
		}
	}

	return 1;
}
void Test()
{
	DataType preOreder[] = "AB##C";
	int index = 0;
	TreeNode *pRoot = CreateTree(preOreder, strlen(preOreder), &index);
	PreOrder(pRoot); printf("\n");
	InOrder(pRoot); printf("\n");
	PostOrder(pRoot);printf("\n");
	printf("结点树: %d\n", GetSize(pRoot));
	printf("叶子结点树: %d\n", GetLeafSize(pRoot));
	int k = 2;
	printf("第%d 结点个数为%d\n", k, GetKLevelSize(pRoot, k));
	printf("树的高度为: %d\n", GetHeight(pRoot));
	LevelOrder(pRoot);
	printf("%d\n", IsComplete(pRoot));
}