C++链式二叉树深入分析

typedef int BTDataType;
typedef struct BinaryTreenode
{
	BTDataType data;
	struct BinaryTreeNode* left;
	struct BinaryTreeNode* right;
}BTNode;
BTNode* BuyNode(BTDataType* x)
{
	BTNode* NewNode = (BTNode*)malloc(sizeof(BTNode));
	assert(NewNode);
	NewNode->data = x;
	NewNode->left = NULL;
	NewNode->right = NULL;
	return NewNode;
}
BTNode* CreatBinaryTree()
{
	BTNode* node1 = BuyNode(1);
	BTNode* node2 = BuyNode(2);
	BTNode* node3 = BuyNode(3);
	BTNode* node4 = BuyNode(4);
	BTNode* node5 = BuyNode(5);
	BTNode* node6 = BuyNode(6);
	node1->left = node2;
	node1->right = node4;
	node2->left = node3;
	node4->left = node5;
	node4->right = node6;
	return node1;
}

void Preorder(BTNode* root)
{
	if (root == NULL)
	{
		printf("* ");//空树打印 * 
		return ;
	}
	printf("%d ", root->data);//先访问 根
	Preorder(root->left);//再访问左子树
	Preorder(root->right);//最后访问右子树
}

void Inorder(BTNode* root)//中序遍历
{
	if (root == NULL)
	{
		printf("* ");//空树打印 * 
		return;
	}
	Preorder(root->left);//先访问左子树
	printf("%d ", root->data);//再访问 根
	Preorder(root->right);//最后访问右子树
}
void Postorder(BTNode* root)//后序遍历
{
	if (root == NULL)
	{
		printf("* ");//空树打印 * 
		return;
	}
	Preorder(root->left);//先访问左子树
	Preorder(root->right);//再访问右子树
	printf("%d ", root->data);//最后访问 根
}

int size；
void TreeSize(BTNode* root)
{
	if (root == NULL)
	{
		return;
	}
	size++;//计数器
	TreeSize(root->left);//访问左子树
	TreeSize(root->right);//访问右子树
}
int main()
{
	BTNode* root = CreatBinaryTree();
	size = 0;
	TreeSize(root);
	printf("TreeSize = %d\n", size);
	return 0;
}

int TreeSize2(BTNode* root)
{
	if (root == NULL)//为NULL返回0
	{
		return 0;
	}
	return TreeSize2(root->left) + TreeSize2(root->right) + 1;
}

int TreeLeafSize(BTNode* root)//求叶子节点
{
	if (root == NULL)//空树返回0
	{
		return 0;
	}
	if (root->left == NULL && root->right == NULL)//左子树为空并且右子树为空返回1
	{
		return 1;
	}
	return TreeLeafSize(root->left) + TreeLeafSize(root->right);
}

int TreeDepth(BTNode* root)
{
	if (root == NULL)//空树返回0
	{
		return 0;
	}
	int Leftdepth = TreeDepth(root->left);//求出左边高度
	int Rightdepth = TreeDepth(root->right);//求出右边高度
	return Leftdepth > Rightdepth ? Leftdepth + 1 : Rightdepth + 1;//返回时加上自身返回
}

BTNode* TreeFind(BTNode* root, BTDataType x)//查找二叉树中值为x的节点
{
	if (root == NULL)//为空返回空
	{
		return NULL;
	}
	if (root->data == x)//相等就返回节点
	{
		return root;
	}
	BTNode* RetLeft = TreeFind(root->left, x);//保存左节点值，方便直接返回
	if (RetLeft)
	{
		return RetLeft;
	}
	BTNode* RetRight = TreeFind(root->right, x);//保存右节点值，方便直接返回
	if (RetRight)
	{
		return RetRight;
	}
	return NULL;//都找不到返回NULL
}