所以我收到这个错误,这与我的 AVLTree 类继承我的 BTree 类的方式有关。据我所知,编译器表现得好像找不到 BTree.h (在同一目录中),或者只是不喜欢我包含它的方式。
我一直在网上四处寻找,但我看到的大多数关于这个问题的例子都涉及到有人忘记包含一些东西,所以我不确定下一步该怎么做。
编辑:我还添加了 BTree.h 的代码示例
任何帮助将不胜感激。
g++ -g -w -Wall TreeTest.cpp BTree.h BinaryTree.h AVLTree.h -o testTrees 在 TreeTest.cpp:12:0: AVLTree.h:22:29: AVLTree.h:22:29 中包含的文件中:错误:预期的类名在'之前{' token TreeTest.cpp: 在函数中
这是代码:
#ifndef AVLTree_H
#define AVLTree_H
#include <vector>
#include <iostream>
#include "BTree.h"
using std::vector;
using std::cout;
using std::string;
template <class T>
class AVLTree : public BTree{
public:
struct TreeNode{
TreeNode * leftChild,
* rightChild;
T key;
vector<T> data;
int size;
int height;
bool deleted;
};
//Standard tree functions
AVLTree();
virtual ~AVLTree();
virtual bool isEmpty();
virtual int getSize();
virtual int getHeight();
virtual int insert(T key, T data); //returns number of insert calls
virtual int remove(T key); //returns number of remove calls
virtual int contains(T key); //removes number of contains calls, or 0 if doesn't exist
virtual std::vector<T> getData(T key);
//Special functions
virtual void displayAll();
virtual double getAverageDepth();
virtual int getTotalIPL(); //Retrieves internal path length from root
private:
int size;
TreeNode * root;
int * contains(T key, TreeNode * node, int calls);
int insert(T key, T data, TreeNode *& node, int calls);
int remove(T key, TreeNode *& node, int calls);
int getDepth(TreeNode*curr, int total);
int getIPL(TreeNode * start, int level);
void rotateLeft(TreeNode *& node);
void doubleLeft(TreeNode *& node);
void rotateRight(TreeNode *& node);
void doubleRight(TreeNode *& node);
int max(int a, int b);
int getHeight( TreeNode * t );
void display(TreeNode * node, string indent, bool last);
TreeNode * makeNode(T key, T data);
TreeNode * getNode(T key, TreeNode * node);
void destroySubTree(TreeNode * start);
};
这是 BTree.h:
#ifndef bTree_H
#define bTree_H
#include <vector>
template <class T>
class BTree{
public:
struct TreeNode{
TreeNode * leftChild,
* rightChild;
T key;
std::vector<T> data;
int size;
};
//Standard tree functions
virtual ~BTree();
virtual bool isEmpty() = 0;
virtual int getSize() = 0;
virtual int getHeight() = 0;
virtual int insert(T key, T data) = 0; //returns number of insert calls
virtual int remove(T key) = 0; //returns number of remove calls
virtual int contains(T key) = 0;
virtual std::vector<T> getData(T key) = 0;
//Special functions
virtual void displayAll() = 0;
virtual double getAverageDepth() = 0;
virtual int getTotalIPL() = 0; //Retrieves internal path length from root
private:
int size;
TreeNode * root;
};
template <class T>
BTree<T>::~BTree<T>(){}
#endif