遍历

给如图所示的二叉树进行先序遍历，中序遍历，后序遍历

先序遍历

先访问根，再访问左，再访问右

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

typedef struct BINARYNODE
{
	char ch;
	struct BINARYNODE* lchild;
	struct BINARYNODE* rchild;
}BinaryNode;

void Recursion(BinaryNode* root)
{
	if(root==NULL)
	{
		return ;
	}
	//先访问根节点
	printf("%c",root->ch);
	//再遍历左子树
	Recursion(root->lchild);
	//再遍历右子树
	Recursion(root->rchild);

}
void CreatBinaryTree()
{
	//创建节点
	BinaryNode node1={'A',NULL,NULL};
	BinaryNode node2={'B',NULL,NULL};
	BinaryNode node3={'C',NULL,NULL};
	BinaryNode node4={'D',NULL,NULL};
	BinaryNode node5={'E',NULL,NULL};
	BinaryNode node6={'F',NULL,NULL};
	BinaryNode node7={'G',NULL,NULL};
	BinaryNode node8={'H',NULL,NULL};

	//建立结点关系
	node1.lchild=&node2;
	node1.rchild=&node6;
	node2.rchild=&node3;
	node3.lchild=&node4;
	node3.rchild=&node5;
	node6.rchild=&node7;
	node7.lchild=&node8;

	//递归遍历
	Recursion(&node1);
	printf("\n");
}
int main()
{
	CreatBinaryTree();
}

中序遍历

先访问左，再访问根，再访问右

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

typedef struct BINARYNODE
{
	char ch;
	struct BINARYNODE* lchild;
	struct BINARYNODE* rchild;
}BinaryNode;

void Recursion(BinaryNode* root)
{
	if(root==NULL)
	{
		return ;
	}

	//先遍历左子树
	Recursion(root->lchild);
	//再访问根节点
	printf("%c",root->ch);
	//再遍历右子树
	Recursion(root->rchild);

}
void CreatBinaryTree()
{
	//创建节点
	BinaryNode node1={'A',NULL,NULL};
	BinaryNode node2={'B',NULL,NULL};
	BinaryNode node3={'C',NULL,NULL};
	BinaryNode node4={'D',NULL,NULL};
	BinaryNode node5={'E',NULL,NULL};
	BinaryNode node6={'F',NULL,NULL};
	BinaryNode node7={'G',NULL,NULL};
	BinaryNode node8={'H',NULL,NULL};

	//建立结点关系
	node1.lchild=&node2;
	node1.rchild=&node6;
	node2.rchild=&node3;
	node3.lchild=&node4;
	node3.rchild=&node5;
	node6.rchild=&node7;
	node7.lchild=&node8;

	//递归遍历
	Recursion(&node1);
	printf("\n");
}
int main()
{
	CreatBinaryTree();
}

后序遍历

先访问左，再访问右，再访问根

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

typedef struct BINARYNODE
{
	char ch;
	struct BINARYNODE* lchild;
	struct BINARYNODE* rchild;
}BinaryNode;

void Recursion(BinaryNode* root)
{
	if(root==NULL)
	{
		return ;
	}

	//先遍历左子树
	Recursion(root->lchild);
	//再遍历右子树
	Recursion(root->rchild);
	//再访问根节点
	printf("%c",root->ch);
}
void CreatBinaryTree()
{
	//创建节点
	BinaryNode node1={'A',NULL,NULL};
	BinaryNode node2={'B',NULL,NULL};
	BinaryNode node3={'C',NULL,NULL};
	BinaryNode node4={'D',NULL,NULL};
	BinaryNode node5={'E',NULL,NULL};
	BinaryNode node6={'F',NULL,NULL};
	BinaryNode node7={'G',NULL,NULL};
	BinaryNode node8={'H',NULL,NULL};

	//建立结点关系
	node1.lchild=&node2;
	node1.rchild=&node6;
	node2.rchild=&node3;
	node3.lchild=&node4;
	node3.rchild=&node5;
	node6.rchild=&node7;
	node7.lchild=&node8;

	//递归遍历
	Recursion(&node1);
	printf("\n");
}
int main()
{
	CreatBinaryTree();
}