dev-c++ 编译器错误没有匹配函数

我以前在处理这段代码，但有一个新问题，旧问题的链接是流血开发C++编译器错误*二叉树。

我有一个错误，在函数"int main（）"中声明没有匹配函数来调用"binaryTreeType：：insert（int&）"候选人是：void binaryTreeType：：insert （） [with elemType = int] 不太确定这是什么。代码发布在下面，任何帮助都非常感谢提前感谢。

#include <iostream>
using namespace std;
template <class elemType>
struct nodeType
{
       int data;
       nodeType *lLink;
       nodeType *rLink;
};
template <class elemType>
class binaryTreeType //main class
{
      public:
             binaryTreeType(); //constructor
             ~binaryTreeType(); //destructor
             void swapSubtreeNodes(); //declares swapSubtreeNodes
             void swapSubtreeNodes(nodeType<elemType>*);
             void insert();
             void printTree();
      private:
              nodeType<elemType>*root; //declares root pointer
              nodeType<elemType> *temp; //declares root pointer
};
template <class elemType>
void binaryTreeType<elemType>::swapSubtreeNodes()
{
     swapSubtreeNodes(root); //displays new root
}
template <class elemType>
void binaryTreeType<elemType>::swapSubtreeNodes(nodeType<elemType> *p)
{
    root = temp;
    nodeType<elemType> *root; //pointer for root
    nodeType<elemType> *temp; //pointer for temp
    if (p == NULL) //checks for empty pointer
    {
          return;
    }
    else
    {
        swapSubtreeNodes(p->lLink); //do the subtrees
        swapSubtreeNodes(p->rLink);                                  
        temp = p->lLink; //swap the pointers
        p->lLink = p->rLink;
        p->rLink = temp;
    }
    root = temp; //root set equal to temp
}
int main()
{
    binaryTreeType<int> (tree);
    int num;
    cout << "This is how we swap'em" << endl;
    cout << "Insert number (press enter after each one entered)." << endl;
    cout << "Enter -999 to complete" << endl;
    binaryTreeType<int> (insert);
    cin >> num;
    while (num != -999)
    {
          tree.insert(num);
          cin >> num;
    }
    cout << "The unswapped binary tree looks like this: " << endl;
         tree.printTree();
         cout << endl;
    cout << "The swapped binary tree looks like this: " << endl;
         tree.swapSubtreeNodes();
         tree.printTree();
         cout << endl;

 }