createbitree(T);printf("先序遍历二叉树为：\n");preordertraverse(T);printf("\n");prinbtree(T);printf("\n");return 0;} 我写的，希望对你有用！