📄 indexedbstree.h
字号:
// abstract class indexedBSTree
// abstract data type specification for indexed binary search trees
// all methods are pure virtual functions
// K is key type and E is value type
#ifndef indexedBSTree_
#define indexedBSTree_
#include "bsTree.h"
using namespace std;
template<class K, class E>
class indexedBSTree : public bsTree<K,E>
{
public:
virtual pair<const K, E>* get(int) const = 0;
// return pointer to pair with given index
virtual void delete(int) = 0;
// delete pair with given index
};
#endif
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -