我们分配了一个具有一些基本功能的二进制搜索树。我认为,如果不是针对作业所包含的文件,那么我们将能够进行抓取,以便我们的评分者使用评分程序来实现我们的代码。向学生提供了一个名为“ Factory.cpp”的文件,该文件具有试图返回“ BinarySearchTree”(return new BinarySearchTree();)对象的功能。但是,VS 2013给了我标题中所示的错误。经过一番研究,我找不到可以解决自己的错误的任何信息。模板类显然更抽象,我无法找出要包含/保留的内容等来使事情正常进行。

以下是我到目前为止在BinarySearchTree.h中拥有的不完整代码:

#pragma once
#include "BSTInterface.h"
#include "NodeInterface.h"

#ifndef BINARY_SEARCH_TREE_H
#define BINARY_SEARCH_TREE_H

    struct BTNode :public NodeInterface{
        // Data Fields
        int data;
        BTNode* left;
        BTNode* right;

        // Constructor
        BTNode(const int& the_data,
            BTNode* left_val = NULL,
            BTNode* right_val = NULL) :
            data(the_data), left(left_val), right(right_val) {}

        // Destructor (to avoid warning message)
        virtual ~BTNode() {}

        // Interface Functions
        int getData(){
            return data;
        }

        NodeInterface* getLeftChild(){
            return left;
        }

        NodeInterface* getRightChild(){
            return right;
        }

    }; // End BTNode



#include <sstream>

template<class T>
class BinarySearchTree:public BSTInterface
{

public:
    BTNode* root;
    // BST Constructor / Deconstructor
    BinarySearchTree() : root(NULL){}

    //BinarySearchTree(const int& the_data,
    //  const BinarySearchTree& left_child = BinarySearchTree(),
    //  const BinarySearchTree& right_child = BinarySearchTree()) :
    //  root(new BTNode(the_data, left_child.root, right_child.root)){}

    virtual ~BinarySearchTree(){}

    // Interface Functions ----------------------

    NodeInterface* getRootNode(){
        return root;
    }


    bool add(int data){
        return addRec(root, data);
    }


    bool addRec(BTNode* &x, int data){
        if (x == NULL){
            if (Search(root, data) == true){
                return false;
            }
            else{
                root = GetNewNode(data);
                return true;
            }
        }
        if (data == x->data){
            return false;
        }
        if (x != NULL){
            if (data < x->data){
                return addRec(x->left, data);
            }
            if (data > x->data){
                return addRec(x->right, data);
            }
        }
    }


    bool remove(int data){
        return false;
    }


    bool removeRec(BTNode* &x, int data){
        return false;
    }


    void clear(){

    }
    // ------------------------------------------


    // My Functions -----------------------------

    BTNode* GetNewNode(int data){
        BTNode* newNode = new BTNode();
        newNode->data = data;
        newNode->left = newNode->right = NULL;
        return newNode;
    }

    bool Search(BTNode* root, int data) {
        if (root == NULL) {
            return false;
        }
        else if (root->data == data) {
            return true;
        }
        else if (data < root->data) { // had <= instead
            return Search(root->left, data);
        }
        else if (data > root->data) { // had no "if"
            return Search(root->right, data);
        }
    }
    // ------------------------------------------
};
#endif


它是从以下2个“接口”文件派生的:

NodeInterface.h:

//YOU MAY NOT MODIFY THIS DOCUMENT
#pragma once
#include <iostream>
class NodeInterface {
public:
    NodeInterface() {}
    virtual ~NodeInterface() {}

    /*Returns the data that is stored in this node*/
    virtual int getData() = 0;

    /*Returns the left child of this node or null if it doesn't have one.*/
    virtual NodeInterface * getLeftChild() = 0;

    /*Returns the right child of this node or null if it doesn't have one.*/
    virtual NodeInterface * getRightChild() = 0;

};


BSTInterface.h

//YOU MAY NOT MODIFY THIS DOCUMENT
#pragma once
#include "NodeInterface.h"
using namespace std;
class BSTInterface {
public:
    BSTInterface() {}
    virtual ~BSTInterface() {}

    //Please note that the class that implements this interface must be made
    //of objects which implement the NodeInterface

    /*Returns the root node for this tree*/
    virtual NodeInterface * getRootNode() = 0;

    /*Attempts to add the given int to the BST tree*/
    virtual bool add(int data) = 0;

    /*Attempts to remove the given int from the BST tree*/
    virtual bool remove(int data) = 0;

    /*Removes all nodes from the tree, resulting in an empty tree.*/
    virtual void clear() = 0;
};


然后,他们给我们提供“ Factory.h”和“ Factory.cpp”,我相信他们会使用它们来抓取我们的BinarySearchTree以便使用其分级程序进行分级:

Factory.h:

    #include "BSTInterface.h"
    using namespace std;
    /*
    WARNING: It is expressly forbidden to modify any part of this document, including its name
    */

    class Factory
    {
    public:
        static BSTInterface * getBST();
    };


Factory.cpp:

#include "Factory.h"
#include "BinarySearchTree.h"
//You may add #include statements here

/*
    You will MODIFY THIS DOCUMENT.

    getBST()
    Creates and returns an object whose class extends BSTInterface.
    This should be an object of a class you have created.
    Example: If you made a class called "BinarySearchTree", you might say, "return new BinarySearchTree();".
*/
BSTInterface * Factory::getBST()
{
    return new BinarySearchTree();//Modify this line
}


在“ Factory.cpp”中,BinarySearchTree在VS中被标记为错误,并显示消息“缺少类模板的参数列表”。我该如何解决?以及您看到的任何其他错误。

另外,我将如何在main()中声明一个新的BinarySearchTree对象并调用其函数以对其进行测试?

最佳答案

对于该错误,在这些行中:

template<class T>
class BinarySearchTree:public BSTInterface
{


只是摆脱第一行。那行告诉编译器您BinarySearchTree类是模板类。但是由于您的班级使用int来存储数据,因此似乎不需要使用。

我没有看过您的其他代码,因此我不会对其他任何内容发表评论。

10-04 18:59