c语言数据结构 二叉树

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>

struct BinaryNode
{
	char ch;//数据域
	struct BinaryNode *lChild;//左孩子节点
	struct BinaryNode *rChild;//右孩子节点
};

//递归遍历
void recursion(struct BinaryNode * root)
{
	if (root == NULL)
	{
		return;
	}
	
	//先序遍历  先根 再左 再右
	printf("%c ", root->ch);
	recursion(root->lChild);
	recursion(root->rChild);
	

	return;
}
void test01()
{
	struct BinaryNode nodeA = { 'A', NULL, NULL };
	struct BinaryNode nodeB = { 'B', NULL, NULL };
	struct BinaryNode nodeC = { 'C', NULL, NULL };
	struct BinaryNode nodeD = { 'D', NULL, NULL };
	struct BinaryNode nodeE = { 'E', NULL, NULL };
	struct BinaryNode nodeF = { 'F', NULL, NULL };
	struct BinaryNode nodeG = { 'G', NULL, NULL };
	struct BinaryNode nodeH = { 'H', NULL, NULL };

	//建立结点之间的关系
	nodeA.lChild = &nodeB;
	nodeA.rChild = &nodeF;

	nodeB.rChild = &nodeC;

	nodeC.lChild = &nodeD;
	nodeC.rChild = &nodeE;

	nodeF.rChild = &nodeG;

	nodeG.lChild = &nodeH;

	recursion(&nodeA);

	return;
}
int main(int argc, char* argv[])
{
	test01();
	system("pause");
	return EXIT_SUCCESS;
}

 运行结果:

//中序遍历 先左 再根 再右
recursion(root->lChild);

printf("%c ", root->ch);

recursion(root->rChild);

运行结果：

//后序遍历 先左 再右 再根
recursion(root->lChild);

recursion(root->rChild);

printf("%c ", root->ch);

 运行结果: