数据结构 二叉树.doc

#include typedef struct bitnode{ char data; bitnode *lchild*rchild; }bitchild; void create(bitnode &t){ char ch; cin>ch; if(ch==)t=NULL; else{ t=new bitnode; t->data=ch; create(t->lchild;