bstree.h
来自「function to compute an expression using 」· C头文件 代码 · 共 22 行
H
22 行
// abstract class bsTree
// abstract data type specification for binary search trees
// all methods are pure virtual functions
// K is key type and E is value type
#ifndef bsTree_
#define bsTree_
#include "dictionary.h"
using namespace std;
template<class K, class E>
class bsTree : public dictionary<K,E>
{
public:
virtual void ascend() = 0;
// output in ascending order of key
};
#endif
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?