f(s->key<p->key)p=p->lchild p-p->rchild return s f(s->key<f->key )f->lchild=s f->rchild=s return t bstnode* creator/返回二叉树 bstnode°t,*s, t=null while(key!=0) s=malloc( sizeof(bitree)) S->lchild=null S->rchild=null scanf( &key return t, maino root=creatordoif(s->key<p->key)p=p->lchild; else p=p->rchild; } if(t==null) return s; if(s->key<f->key)f->lchild=s; else f->rchild=s; return t; } bstnode *creatord()//返回二叉树 { bstnode *t , *s; int key; t=null; scanf(&key); while(key!=0) { s=malloc(sizeof(bitree)); s->key=key; s->lchild=null; s->rchild=null; scanf(&data); s->other=data; t=insertbst(t,s); scanf(&key); } return t; } main() { bstnode *root; root=creatord(); inorder(root); }