先序建立二叉树，再中序输出

#include<iostream>
#include<cstring>
using namespace std;
char a[100];
int len;
typedef struct node{
    char data;
    struct node *right,*left; //abc##d##ef###

};
 
struct node *create(struct node *newNode){//先序创建二叉树 
    char data;
    scanf("%c",&data);
    if(data == '#'){
        newNode = NULL;
    }else{
        newNode = (struct node *)malloc(sizeof(struct node));
        newNode->data = data;
        newNode->left = create(newNode->left);
        newNode->right = create(newNode->right);
    }
    return newNode;
}


void inorder(struct node *p){
    if(p) {
inorder(p ->left);
cout<<p ->data<<" ";
inorder(p ->right);
}
//return;
}


int main(){
//cin>>a;
 //len = strlen(a);
struct node *p = NULL;
p = create(p);

inorder(p);
    return 0;
}