编程实现二叉树的建立，前序遍历，中序遍历和后续遍历

前序遍历：1.访问根节点，2.前序遍历左子树，3.前序遍历右子树。

中序遍历：1.中序遍历左子树，2.访问根节点，3.中序遍历右子树。

后序遍历：1.后序遍历左子树，2.后序遍历右子树。3.访问根节点。

c/c++程序如下：

#include<iostream>
using namespace std;

typedef struct TreeNode{
	char data;
	struct TreeNode *left;
	struct TreeNode *right;
} node;

node *createTreePreOrder()
{
	char ch;
	node *root = NULL;
	
	fflush(stdin);//清空标准输入流
	ch = getchar();
	if(ch == ' ')
	{
		root = NULL;
	}
	else
	{
		root = (node *)malloc(sizeof(node));
		root->data = ch;
		printf("\n请输入节点%c的左子结点:",root->data);
		root->left = createTreePreOrder();
		printf("\n请输入节点%c的右子结点:",root->data);
		root->right = createTreePreOrder();
	}
	return root;
}

//前序遍历
int traverseTreePreOrder(node *root, int (*visit)(char))
{
	if(root)
	{
		if(visit(root->data))
			if(traverseTreePreOrder(root->left, visit))
				if(traverseTreePreOrder(root->right, visit))
					return 1;
				return 0;
	}else
		return 1;
}

//中序遍历
int traverseTreeMidOrder(node *root, int (*visit)(char))
{
	if(root)
	{
		if(traverseTreePreOrder(root->left, visit))
			if(visit(root->data))
				if(traverseTreePreOrder(root->right, visit))
					return 1;
				return 0;
	}else
		return 1;
}

//后序遍历
int traverseTreePostOrder(node *root, int (*visit)(char))
{
	if(root)
	{
		if(traverseTreePreOrder(root->left, visit))
			if(traverseTreePreOrder(root->right, visit))
				if(visit(root->data))
					return 1;
				return 0;
	}else
		return 1;
}

int print(char c)
{
	cout << c << "->";
	return 1;
}

int main()
{
	node *root;
	cout << "请输入根节点:";
	root = createTreePreOrder();
	traverseTreePreOrder(root, print);
	cout << endl;
	traverseTreeMidOrder(root, print);
	cout << endl;
	traverseTreePostOrder(root, print);
	cout << endl;
	return 0;
}