二叉树（完善中）

#define OK 0;#define ERROR 1;typedef struct tnode *link;struct node{char data;link left,right;}*tree;int creattree(tree &t){char temp;scanf("%c",&temp);if(temp!='0'){t=(tree)malloc(sizeof(tree))t->data=temp;creattree(t->left);creattree(t->right);}return OK;}int visit(char data){printf("%c",data);return OK;}int ordertravel(tree t){ordertravel(t->left);visit(t->data);ordertravel(t->right);return OK;}int main(){tree root;creatterr(root);ordertravel(root);system("pause");}