判别两序列所对应两颗二叉搜索树是否相同之建立一颗树4.134

不说别的，直接贴代码

/**by phoeinx 1903935168***/
#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
typedef int Ele;
typedef struct Tnode{
Ele data;
struct Tnode *left;
struct Tnode *right;
int visited;
}*Tree,*Ptnode;


Tree insert(Tree tree,Ele data){
if(!tree){
tree=(Ptnode)malloc(sizeof(struct Tnode));
tree->data=data;
tree->visited=0;
tree->left=NULL;
tree->right=NULL;
}else{
if(data<tree->data)
	tree->left=insert(tree->left,data);
else if(data>tree->data)
    tree->right=insert(tree->right,data);
}
return tree;

}

bool check(Tree tree,Ele data){
	bool yes=false;
if(tree->visited==1){
if(data>tree->data)
return check(tree->right,data);
else if(data<tree->data)
return check(tree->left,data);
else
yes=false;
}else{
if(data>tree->data)
yes=false;
else if(data<tree->data)
yes=false;
else{
tree->visited=1;
	yes=true;
}
}
return yes;
}

void resetvisiited(Tree tree){//这里用不到此函数
if(tree){
tree->visited=0;
resetvisiited(tree->left);
resetvisiited(tree->right);
}
}

void freetree(Tree *pttree){//后续遍历释放内存
if(*pttree){
freetree(&(*pttree)->left);
freetree(&(*pttree)->right);
free(*pttree);
*pttree=NULL;
}
}



bool isone(Ele s1[],Ele s2[],int n){
	bool yes=true;
Tree tree=NULL;
for(int i=0;i<n;i++){
	tree=insert(tree,s1[i]);
}
for(int i=0;i<n;i++){
if(!check(tree,s2[i]))
{yes=false;break;}
}
freetree(&tree);
return yes;
}

int main(){
Ele s1[6]={2,3,1,4,5,6};
Ele s2[6]={2,1,3,4,5,6};
if(isone(s1,s2,6))
	printf("one\n");
else
	printf("no one\n");


}