我的二叉树有链接器错误

Question

我有一个BinarySearchTree类和一个BinaryNode类。我的代码的语法是正确的。但在编译时，它会生成链接器错误。我只尝试过Visual Studio 2012的compilor，我希望使用相同的compilor，因为我的整个项目都在VS2012上。我编写了类的代码和下面的所有函数，首先，错误如下::

1＆gt; Source.obj：错误LNK2019：未解析的外部符号＆＃34; public：__ thiscall BinarySearchTree :: BinarySearchTree（int const＆amp;）＆＃34;函数_main

中引用了（?? 0？$ BinarySearchTree @ H @@ QAE @ ABH @ Z）

1＆gt; Source.obj：错误LNK2019：未解析的外部符号＆＃34; public：__ thiscall BinarySearchTree :: ~binarySearchTree（void）＆＃34;函数_main

中引用了（?? 1？$ BinarySearchTree @ H @@ QAE @ XZ）

1＆gt; Source.obj：错误LNK2019：未解析的外部符号＆＃34; public：void __thiscall BinarySearchTree :: insert（int const＆amp;）＆＃34; （？insert @？$ BinarySearchTree @ H @@ QAEXABH @ Z）在函数_main中引用

1＆gt; Source.obj：错误LNK2019：未解析的外部符号＆＃34; public：void __thiscall BinarySearchTree :: remove（int const＆amp;）＆＃34; （？remove @？$ BinarySearchTree @ H @@ QAEXABH @ Z）在函数_main中引用

1＆gt; Source.obj：错误LNK2019：未解析的外部符号＆＃34; public：void __thiscall BinarySearchTree :: printTree（void）const＆＃34; （？printTree @？$ BinarySearchTree @ H @@ QBEXXZ）在函数_main中引用

1＆gt; c：\ users \ aftab electronics \ documents \ visual studio 2012 \ Projects \ BST \ Debug \ BST.exe：致命错误LNK1120：5个未解析的外部

//BinarySearchTree.h
#ifndef _BINARY_SEARCH_TREE_H
#define _BINARY_SEARCH_TREE_H
#include<iostream>

//Binary Node and Forward Declaration
template<class EType> class BinarySearchTree;

template<class EType> class BinaryNode{
    EType element;
    BinaryNode* left, *right;

public:
    BinaryNode(const EType& theElement, BinaryNode* lt, BinaryNode *rt):element(theElement),left(lt),right(rt){}
    friend class BinarySearchTree<EType>;
};

template<class EType> class BinarySearchTree{
public:
    BinarySearchTree(const EType& notFound);
    BinarySearchTree(const BinarySearchTree& rhs);
    ~BinarySearchTree();

    const EType& findMin() const;
    const EType& findMax() const;
    const EType& find(const EType& x) const;
    bool isEmpty() const;
    void printInOrder() const;
    void insert(const EType& x);
    void remove(const EType& x);
    void printTree() const;
    void printTree(BinaryNode<EType>* ) const;
    BinaryNode<EType>* clone(BinaryNode<EType> *t) const;

    const BinarySearchTree& operator= (const BinarySearchTree& rhs);

private:
    BinaryNode<EType>* root;
    //ITEM_NOT_FOUND object used to signal failed finds
    const EType ITEM_NOT_FOUND;
    const EType& elementAt(BinaryNode<EType>* t) const;
    void insert(const EType& x, BinaryNode<EType>* &t);
    void remove(const EType& x, BinaryNode<EType>* &t);
    BinaryNode<EType>* findMin(BinaryNode<EType>* t) const;
    BinaryNode<EType>* findMax(BinaryNode<EType>* t) const;
    BinaryNode<EType>* find(const EType& x, BinaryNode<EType>* t) const;
    void makeEmpty(BinaryNode<EType>* &t);
    void printInOrder(BinaryNode<EType>* t);
    void makeEmpty();
};
#endif

然后，实现文件BinarySearchTree.cpp如下：

#include "BinarySearchTree.h"
#include<iostream>

//Construct The Tree
template<class EType> BinarySearchTree<EType>::BinarySearchTree(const EType& notFound):ITEM_NOT_FOUND(notFound), root(NULL){}

//Copy COnstructor
template<class EType> BinarySearchTree<EType>::BinarySearchTree(const BinarySearchTree<EType>& rhs):root(NULL),ITEM_NOT_FOUND(rhs.ITEM_NOT_FOUND)
{
    *this = rhs;
}

//Destructor
template<class EType> BinarySearchTree<EType>::~BinarySearchTree(){makeEmpty();}

//Insert x into the Tree, Duplicates are iqnored
template<class EType> void BinarySearchTree<EType>::insert(const EType& x){insert(x, root);}

//Remove X from the Tree. Nothing is done if x is not found.
template<class EType> void BinarySearchTree<EType>::remove(const EType& x){remove(x, root);}

//Find the smallest item in the tree. Return it. Return ITEM_NOT_FOUND if empty
template<class EType> const EType& BinarySearchTree<EType>::findMin() const
{
    return elementAt (findMin(root));
}

//Find largest item in tree. return or return ITEM_NOT_FOUND if empty
template<class EType> const EType& BinarySearchTree<EType>::findMax() const {
    return elementAt(findMax(root));
}

//Find item x in the tree. return the matching or ITEM_NOT_FOUND if not exist
template<class EType> const EType& BinarySearchTree<EType>::find(const EType& x) const{
    return elementAt(find(x,root));
}

//Make the tree logically empty
template<class EType> void BinarySearchTree<EType>::makeEmpty(){
    makeEmpty(root);
}

//Test if the tree is logically empty. Return true otherwise false
template<class EType> bool BinarySearchTree<EType>::isEmpty() const{
    return root == NULL;
}

//Print Tree in sorted order
template<class EType> void BinarySearchTree<EType>::printTree() const {
    if (isEmpty())
        cout<< "Empty Tree\n";
    else
        printTree(root);
}

//Deep Copy
template<class EType> const BinarySearchTree<EType>& BinarySearchTree<EType>::operator=(const BinarySearchTree<EType>& rhs){

    if(this != &rhs){
        makeEmpty();
        root = clone(rhs.root);
    }
    return *this;
}

//Internal Method to get element in field in node t. Return the element field or ITEM_NOT_FOUND if t is NULL
template<class EType> const EType& BinarySearchTree<EType>::elementAt(BinaryNode<EType> *t) const {
    if(t == NULL) return ITEM_NOT_FOUND;
    else return t->element;
}

//internal method to insert into a subtree. x is to be inserted, t roots the tree. 
template<class EType> void BinarySearchTree<EType>::insert(const EType& x, BinaryNode<EType>* &t) {
    if(t==NULL)
        t = new BinaryNode<EType>(x, NULL, NULL);
    else if(x < t->element)
        insert(x, t->left);
    else if(t->left < x)
        insert(x, t->right);
    else
        ; // duplicate do nothing
}

//Internal method to remove from a subtree. x is the item to remove. t is the node that roots the tree. 
template<class EType> void BinarySearchTree<EType>::remove(const EType& x, BinaryNode<EType>* &t) {
    if(t == NULL) return; //Item not found, do nothing
    if(x < t->element) 
        remove(x, t->left);
    else if(t->element < x) 
        remove(x, t->right);
    else if(t->left != NULL && t->right != NULL) 
    {
        t->element = findMin(t->right)->element;
        remove(t->element, t->right);   
    }
    else {
        BinaryNode<EType>* nodeToDelete = t;
        t = (t->left != NULL) ? t->left : t->right;
        delete nodeToDelete;

    }
}
// Internal method to find the smallest item in a subtree t. return node containing the smallest item. 
template<class EType> BinaryNode<EType>* BinarySearchTree<EType>::findMin(BinaryNode<EType>* t) const {
    if(t == NULL) return NULL;
    if(t->left == NULL) return t;
    return findMin(t->left);
}


// Internal method to find the largest item in a subtree t. Return node containg the largest item. 
template<class EType> BinaryNode<EType>* BinarySearchTree<EType>::findMax(BinaryNode<EType>* t) const{
    if(t != NULL)
        while(t->right != NULL)
            t = t->right;
    return t;
}

//Internal method to find an item in a subtree. x is searchee. t node roots the tree. return node containg match item
template<class EType> BinaryNode<EType>* BinarySearchTree<EType>::find(const EType& x, BinaryNode<EType> *t) const {
    if(t == NULL) return NULL;
    else if(x < t->element) return find(x, t->left);
    else if(t->element < x) return find(x, t->right);
    else return t; //Match

    //// NON RECURSIVE VERSION ///
    /*
        while(t != NULL)
            if(x < t->element)
                t = t->left;
            else if(t->element < x)
                t = t->right;
            else
                return t; // Match
        return NULL; //No Match
    */
}

//INternal method to make subtree empty
template<class EType> void BinarySearchTree<EType>::makeEmpty(BinaryNode<EType>* &t){
    if(t != NULL){
        makeEmpty(t->left);
        makeEmpty(t->right);
        delete t;
    }
    t = NULL;
}

//Internal method to print subtree rooted at t in sorted order
template<class EType> void BinarySearchTree<EType>::printTree(BinaryNode<EType>* t) const {
    if(t != NULL){
        printTree(t->left);
        cout<<t->element<<endl;
        printTree(t->right);
    }
}

//Internal method to clone subtree
template<class EType> BinaryNode<EType>* BinarySearchTree<EType>::clone(BinaryNode<EType> *t) const{
    if(t == NULL) return NULL;
    else return new BinaryNode<EType>(t->element, clone(t->left), clone(t->right));
}

之后，包含主程序的source.cpp文件是：

#include<iostream>
#include "BinarySearchTree.h"

int main(){

    const int ITEM_NOT_FOUND = -9999;
    BinarySearchTree<int> t(ITEM_NOT_FOUND);
    int NUMS = 30;
    int i;

    std::cout<<"Inserting Elements (1 to 30) in the trees ..... )"<<std::endl;
    for(i=0; i<=NUMS; i++)
        t.insert(i);

    std::cout<<"Printing the values of nodes in tree...."<<std::endl;
    t.printTree();

    std::cout<<"\n\nRemoving the even number elements in the tree ..........."<<std::endl;
    for(i=0; i<=NUMS; i+=2)
        t.remove(i);

    std::cout<<"Printing the values of nodes in tree....."<<std::endl;
    t.printTree();

system("pause");

}

请告诉我如何解决这些链接器错误。