二叉排序树的建立和中根遍历

#include #include typedef int ElemType; typedef struct node { ElemType data; struct node *lch,*rch; }Snode; Snode *creat_bt0(); Snode *creat_bt1(); Snode *insert0(Snode *t,Snode *s); Snode *insert1(Snode *t,Snode *s); void inorder(Snode *p);