二叉树的先序创建
#include<iostream>
#include<cstdlib>
using namespace std;
typedef struct node{
char data;
struct node* Lc;
struct node* Rc;
}BTtree;
int Pos=0;
char str[5000];
void Cre(BTtree* &T)
{
T=NULL;
char t=str[Pos++];
if(t!='#'){
T=(BTtree*)malloc(sizeof(BTtree));
T->data=t;
Cre(T->Lc);
Cre(T->Rc);
}
}
int main()
{
BTtree* T;
cin>>str;
Cre(T);
return 0;
}