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;
}