C语言实现二叉树

1. C语言实现二叉树中节点间最大距离

#include<stdio.h>

typedef struct TreeNode
{
	int data;
	struct TreeNode * lchild;
	struct TreeNode * rchild;
}TreeNode;

/*
我们可以将所有的结点的左右子树的高度和计算一下，然后取出最大值，就是最远的距离。
*/

int getMaxDistance(TreeNode * root, int * maxDistance)
{
	if (root == NULL)
	{
		return 0;
	}

	int leftdepth = 0;
	int rightdepth = 0;
	int maxdepth = 0; //左右子树深度中最大的一个

	int leftAddRight = 0;
	//int maxDistance = 0;// 不同根节点中，左右子树深度之和，最大的子树

	leftdepth = getMaxDistance(root->lchild, maxDistance);
	rightdepth = getMaxDistance(root->rchild, maxDistance);
	maxdepth = (leftdepth > rightdepth ? leftdepth : rightdepth) + 1;

	leftAddRight = leftdepth + rightdepth;
	*maxDistance = *maxDistance > leftAddRight ? *maxDistance : leftAddRight;

	return maxdepth;
}

int main()
{
	TreeNode t1, t2, t3, t4, t5, t6, t7, t8, t9; //定义树的5个节点
	memset(&t1, 0, sizeof(TreeNode));
	memset(&t2, 0, sizeof(TreeNode));
	memset(&t3, 0, sizeof(TreeNode));
	memset(&t4, 0, sizeof(TreeNode));
	memset(&t5, 0, sizeof(TreeNode));
	memset(&t6, 0, sizeof(TreeNode));
	memset(&t7, 0, sizeof(TreeNode));
	memset(&t8, 0, sizeof(TreeNode));
	memset(&t9, 0, sizeof(TreeNode));

	t1.data = 1;
	t2.data = 2;
	t3.data = 3;
	t4.data = 4;
	t5.data = 5;
	t6.data = 6;
	t7.data = 7;
	t8.data = 8;
	t9.data = 9;

	//打造节点与节点之间的关系
	t1.lchild = &t2;
	t1.rchild = &t3;
	t2.lchild = &t4;
	t2.rchild = &t5;
	t4.lchild = &t6;
	t5.rchild = &t8;
	t6.lchild = &t7;
	t8.rchild = &t9;

	int maxDistance;
	int maxdepth;
	maxdepth = getMaxDistance(&t1, &maxDistance);
	printf("%d\n", maxDistance);
	printf("%d\n", maxdepth);

	return 0;
}

2. C语言实现计算二叉树中第K层节点个数

#include<stdio.h>

typedef struct TreeNode
{
	int data;
	struct TreeNode * lchild;
	struct TreeNode * rchild;
}TreeNode;

int numNodeKLevel(TreeNode * root, int k)
{
	if (root == NULL || k < 1)
	{
		return 0;
	}

	int leftNum = 0;
	int rightNum = 0;
	int kThNum = 0;

	if (k == 1)
	{
		return 1;
	}

	leftNum = numNodeKLevel(root->lchild, k - 1);
	rightNum = numNodeKLevel(root->rchild, k - 1);
	kThNum = leftNum + rightNum;

	return kThNum;
}

3. C语言实现二叉树根节点到叶子节点的最小距离

#include<stdio.h>

typedef struct TreeNode
{
	int data;
	struct TreeNode * lchild;
	struct TreeNode * rchild;
}TreeNode;

//根节点到叶子结点的最小的距离
int minDepth(TreeNode * root)
{
	if (root == NULL)
	{
		return 0;
	}

	//如果是叶子结点则返回
	if (root->lchild == NULL && root->rchild == NULL) //叶子结点
	{
		return 1;
	}

	int minleft = 0;
	int minright = 0;
	int mindepth = 0;

	//如果存在左子树则计算左子树的最小深度
	if (root->lchild != NULL)  
	{
		minleft = minDepth(root->lchild) + 1;
	}
	//如果存在右子树则计算左子树的最小深度
	if (root->rchild != NULL)
	{
		minright = minDepth(root->rchild) + 1;
	}

	if (root->rchild == NULL)
	{
		mindepth = minleft; //如果只存在左子树则计算左子树的最小深度，最小深度为左子树
	}
	else if (root->lchild == NULL)
	{
		mindepth = minright; //如果只存在右子树则计算左子树的最小深度，最小深度为右子树
	}
	else
	{
		mindepth = minleft < minright ? minleft : minright; //如果左右子树都存在，为其中最小的
	}

	return mindepth;
}