else
f->rchild = p;
}
}
bstree creatbstree(bstree t) {
datatype key;
//scanf(\ cin>>key; while(key != -1) { insertbstree(&t,key); //scanf(\ cin>>key;
} return t;
}
void inorder(bstree t) { if (t)
{ inorder(t->lchild);
printf(\ \ inorder(t->rchild);
}
}
int main(void) {
- 24 -
bstree t = NULL,p;
//cout< cout<<\创建一个输入-1为作为结束标记:排序二叉树:\ //printf(\请输入一个-1为结束标记的结点序列:\\n\ p = creatbstree(t); //inorder(creatbstree(t)); inorder(p); return 0; } - 25 -
