这是我创建二叉树的程序，怎样改才能创建二叉排序树。

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>

typedef struct BTnode{
    int data;
    struct BTnode *lchild,*rchild;
}BTNODE,*PBTNODE;

PBTNODE create_BTree(PBTNODE);
void inordertraverse_BTree(PBTNODE T);

int main (void){
    PBTNODE H=NULL;
    H=create_BTree(H);
    printf("中序遍历为：");
    inordertraverse_BTree(H);
    return 0;
}

PBTNODE create_BTree(PBTNODE T)
{  
    int i;
    scanf("%d",&i);
    if(-1==i)
    { T=NULL;
    }
    else {
    T=(BTNODE *)malloc(sizeof(BTNODE));
    T->data=i;
    T->lchild=create_BTree(T->lchild);
    T->rchild=create_BTree(T->rchild);
    }
   
     return T;
}

//中序遍历
void inordertraverse_BTree(PBTNODE T){
  if(NULL!=T)
  {   if(NULL!=T->lchild)
  {  inordertraverse_BTree(T->lchild);}
          printf("%d\n",T->data);
         if(NULL!=T->rchild)
         {  inordertraverse_BTree(T->rchild);
         }
  }   
}

mark，下班了，明天来看

我这里有个程序
#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
#define NULL 0
typedef struct BiTNode{
    char data;
    struct BiTNode    * lchild, * rchild;
}BiTNode, *BiTree;
int CreateBiTree(BiTree &T){//按先序次序输入二叉树中结点的值
    char e;
    scanf_s ("%c",&e);
    getchar();
    if(e == '#')
        T = NULL;
    else
    {
        T = (BiTree)malloc(sizeof(BiTNode));
        if(!T)
        {
            printf("分配内存失败\n");
            exit(0);
        }
        T->data = e;
        CreateBiTree(T->lchild);
        CreateBiTree(T->rchild);
    }
    return 1;
}
int PreOrderTraverse(BiTree T){//先序遍历二叉树T
    if(T){
            printf("%c ",T->data);
            PreOrderTraverse(T->lchild);
            PreOrderTraverse(T->rchild);
    }else
        return 1;
}
int InOrderTraverse(BiTree T)//中序遍历二叉树T
{
    if(T){
        InOrderTraverse(T->lchild);
        printf("%c ",T->data);
        InOrderTraverse(T->rchild);
    }else
        return 1;
}
int PostOrderTraverse(BiTree T)//后序遍历二叉树T
{
    if (T){
    PostOrderTraverse(T->lchild);
    PostOrderTraverse(T->rchild);
    printf("%c ",T->data);
    }
    return 1;
}
int LeafCount(BiTree T){//计算叶子结点
    if(!T)
        return 0;
    else if(!T->lchild&&!T->rchild)
        return 1;
    else
        return LeafCount(T->lchild) + LeafCount(T->rchild);
}
int Depth(BiTree T)//求树的深度
{
    int dep,L,R;
    if(!T)
        dep = 0;
    else
    {
        L = Depth(T->lchild);
        R = Depth(T->rchild);
        dep = 1 + (L>R?L:R);
    }
    return dep;
}
int main()
{
    int m,n;
    BiTree T;
    printf("Input the bitree:\n");
    CreateBiTree(T);
    printf("先序遍历二叉树：");
    PreOrderTraverse(T);
    printf("\n");
    printf("中序遍历二叉树：");
    InOrderTraverse(T);
    printf("\n");
    printf("后序遍历二叉树：");
    PostOrderTraverse(T);
    printf("\n");
    m = LeafCount(T);
    n = Depth(T);
    printf("总的叶子节点数是：%d\n",m);
    printf("此树深度为：%d\n",n);
    return 0;
}