onealwjwjwjwj的专栏

用的二叉排序树，挺快的！#include #include #include typedef struct node//树节点 { char name[31]; float num; struct node * lchild; struct node * rchild; }node; int SearchBST( node* T,char in[], node *f, node *&p) // name)==0){ p = T;return 1;} else if(strcm