二叉排序树的构建

typedefstructnode{intdata;structnode*lchild,*rchild;}*BTREE;BTREESort_tree(intk[],intn);voidInsert(BTREE&t,intitem);voidINORDER(BTREE&t);intmain(){inti=0,numOfInt;BTREEt;scanf("%d",&numOfInt;);int*k=(int*)malloc(numOfInt*sizeof(int));for(;i&