手写二叉树（c++）

目录

1.功能

2.功能模块

3.全局代码

---

1.功能

(1)创建树

(2)前序遍历

(3)中序遍历

(4)后序遍历

2.功能模块

树结构体

typedef struct binary_tree
{
	string data;
	struct binary_tree* lchild;
	struct binary_tree* rchild;
}BTree,*btree;

(1)创建树（非常滴人性化）

//创建一个树
void creat_tree(btree T)
{
	T->data = 'A';
	T->lchild = new BTree;
	T->lchild->data = 'B';
	T->lchild->lchild = new BTree;
	T->lchild->lchild->data = 'C';
	T->lchild->lchild->lchild = T->lchild->lchild->rchild = NULL;
	T->rchild = new BTree;
	T->rchild->data = 'D';
	T->rchild->lchild = NULL;
	T->rchild->rchild = NULL;
}

                    

(2)前序遍历

//前序遍历
void pre_traverse(btree T)
{
	if(T == NULL)
	{
		return;
	}
	else
	{
		cout << T->data;
		pre_traverse(T->lchild);
		pre_traverse(T->rchild);
	}
	return ;
}

(3)中序遍历

//中序遍历
void in_traverse(btree T)
{
	if(T == NULL)
	{
		return;
	}
	else
	{	
		pre_traverse(T->lchild);
		cout << T->data;
		pre_traverse(T->rchild);
	}
	return ;
}

(4)后序遍历

//后序遍历 
void post_traverse(btree T)
{
	if(T == NULL)
	{
		return;
	}
	else
	{
		
		pre_traverse(T->lchild);
		pre_traverse(T->rchild);
		cout << T->data;
	}
	return ;
}

3.全局代码

#include <iostream>
#include <string>
using namespace std;
#define OK 1
#define ERROR 0
#define OVER -1
typedef int status;
typedef struct binary_tree
{
	string data;
	struct binary_tree* lchild;
	struct binary_tree* rchild;
}BTree,*btree;
//创建一个树
void creat_tree(btree T)
{
	T->data = 'A';
	T->lchild = new BTree;
	T->lchild->data = 'B';
	T->lchild->lchild = new BTree;
	T->lchild->lchild->data = 'C';
	T->lchild->lchild->lchild = T->lchild->lchild->rchild = NULL;
	T->rchild = new BTree;
	T->rchild->data = 'D';
	T->rchild->lchild = NULL;
	T->rchild->rchild = NULL;
}
//前序遍历
void pre_traverse(btree T)
{
	if(T == NULL)
	{
		return;
	}
	else
	{
		cout << T->data;
		pre_traverse(T->lchild);
		pre_traverse(T->rchild);
	}
	return ;
}
//中序遍历
void in_traverse(btree T)
{
	if(T == NULL)
	{
		return;
	}
	else
	{	
		pre_traverse(T->lchild);
		cout << T->data;
		pre_traverse(T->rchild);
	}
	return ;
}
//后序遍历 
void post_traverse(btree T)
{
	if(T == NULL)
	{
		return;
	}
	else
	{
		
		pre_traverse(T->lchild);
		pre_traverse(T->rchild);
		cout << T->data;
	}
	return ;
}
 
int main()
{
	btree root = new BTree;
	creat_tree(root);
	in_traverse(root);
	delete root;
	return 0;
}