m0_46965984的博客

1.二叉排序树 #include<iostream> using namespace std; typedef struct BiNode{ int data; struct BiNode *lchild,*rchild; }BiTNode,*BiTree; void CreateBiTree(BiTree &T){ int ch; cin >> ch; if(ch==-1) T=NULL; else{ T=new BiTNod