先序中序后序以及先序建立二叉树

#include<bits/stdc++.h>
using namespace std;
typedef char eletype;
typedef struct node{
	struct node *left;
	struct node *right;
	eletype value;
}treenode,*tree;

//1.先序遍历 
void preOrder(tree root){
	if(root!=NULL){
		cout<<root->value<<" ";
		preOrder(root->left);
		preOrder(root->right);
	}
}

//2.中序遍历 
void inOrder(tree root){
	if(root!=NULL){
		inOrder(root->left);
		cout<<root->value<<" ";
		inOrder(root->right);
	}
} 

//2.后序遍历 
void lasOrder(tree root){
	if(root!=NULL){
		lasOrder(root->left);
		lasOrder(root->right);
		cout<<root->value<<" ";
	}
} 

//4. //建树 
void crtTreenode(tree *root){
	char ch=getchar();
		getchar(); 
	if(ch=='/'){
		*root=NULL;
	}
	else{
		(*root)=new treenode;
		(*root)->value=ch;
		crtTreenode(&(*root)->left);
		crtTreenode(&(*root)->right);	
	}
}

int main(){
	tree p;
	crtTreenode(&p);
	cout<<"先序输出："<<endl; 
	preOrder(p);
	cout<<endl;
	
	cout<<"中序输出："<<endl; 
	inOrder(p);
	cout<<endl;
	
	cout<<"后序输出："<<endl; 
	lasOrder(p);

	//  输入ab//cd///
}

注：建立树过程使用的二重指针，否则会报错，类似swap值传递，具体参考这篇文章

https://blog.csdn.net/weixin_30687051/article/details/97575222?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522170842110716800227439912%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fall.%2522%257D&request_id=170842110716800227439912&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~first_rank_ecpm_v1~rank_v31_ecpm-1-97575222-null-null.142^v99^pc_search_result_base4&utm_term=%E4%BA%8C%E9%87%8D%E6%8C%87%E9%92%88%E4%B8%8Emalloc%E5%87%BD%E6%95%B0&spm=1018.2226.3001.4187

运行结果：

欢迎参考学习，批评指正