c++ 二叉查找树模板示例.docVIP

#includeiostream using namespace std; templateclass Type class BinarySearchTree { private: struct BinaryNode { Type element; BinaryNode* left; BinaryNode* right; BinaryNode(const Type t,BinaryNode* lp, BinaryNode* rp) :element(t),left(lp),right(rp){} }; BinaryNode* root; public: BinarySearchTree():root(NULL){} BinarySearchTree(const BinarySearchTreeType ); ~BinarySearchTree(); BinarySearchTreeType operator=(const BinarySearchTreeType ); bool empty()const{return root==NULL;} const Type findMax()const; const Type findMin()const; bool find(const Type t)const; void pr