算法设计与分析书中程序(第03章).docVIP

【程序3-1】 伸展树类 #include iostream.h enum ResultCode{Underflow, Overflow, Success, Duplicate, Fail, NotPresent}; templateclass T struct BTNode {//二叉树结点类 BTNode(const T x) { element=x; lChild=rChild=NULL; } T element; BTNode* lChild,*rChild; }; templateclass T, class K class SPTree {//伸展树类 public: SPTree(){root=NULL;} ResultCode Insert(T x); ( protected: BTNodeT* root; private: ResultCode Insert(BTNodeT* p, T x); void LRot(BTNodeT* p); void RRot(BTNodeT* p); ( }; 【程序3-2】 旋转函数 template class T void SPTreeT::LRot(BTNodeT* p) { //前置条件：p有右孩子，实现向左旋转 BTNodeT* r=p-rChild;