二叉搜索树(BST)类模板.docVIP

#includeiostream #includecstdio #includestack #includevector #includecstdlib #includecstdio #includestring #includeclimits #includequeue using namespace std; templatetypename elem class binNode { public: elem val; binNodeelem *left,*right; binNode(elem v,binNode *leftChild,binNode *rightChild) :val(v),left(leftChild),right(rightChild){} binNode(){} }; templatetypename elem class binTree { private: int maxheight; binNodeelem *root; stackbinNodeelem* sta; size_t size; void make_empty(binNodeelem *Sroot) { if(Sroot!=NULL) { make_empty(Sroot-left); make_empty(Sroot-right);