C语言程序—二叉排序树的建立与遍历

{ if(bt==NULL) return;

printf(\ printftree(bt->lchild); printftree(bt->rchild); }

void preorder(nodetype *bt) {

if(bt==NULL) return;

printf(\ if(bt->lchild!=NULL) preorder(bt->lchild); if(bt->rchild!=NULL) preorder(bt->rchild); }

void inorder(nodetype *bt) {

if(bt==NULL) return; if(bt->lchild!=NULL) inorder(bt->lchild);

printf(\

if(bt->rchild!=NULL) inorder(bt->rchild); }

void postorder(nodetype *bt) {

if(bt==NULL) return; if(bt->lchild!=NULL) postorder(bt->lchild); if(bt->rchild!=NULL) postorder(bt->rchild);

printf(\ }