алгоритм — Шаблонный класс и int main () в переполнении стека

Я пытаюсь переписать «обычный» класс в шаблонный класс. Я столкнулся с проблемой — функция int main (). Я не уверен, что проблемы именно здесь, но компилятор сообщает «пропущенные аргументы шаблона перед ‘b’«. Я не смог найти пример кода, связанного с подобной проблемой в Интернете. Не могли бы вы помочь мне, пожалуйста?

Вот код, который я нашел:

#include <process.h>
#include <conio.h>
#include <iostream>
#include <cstdlib>

using namespace std;

class BinarySearchTree
{
private:
struct tree_node
{
tree_node* left;
tree_node* right;
int data;
};
tree_node* root;
public:
BinarySearchTree()
{
root = NULL;
}

bool isEmpty() const { return root==NULL; }
void insert(int);
bool search(int);

};

//----------------------------------------------------

bool BinarySearchTree::search(int d)
{
tree_node* temp = root;
while (temp != NULL)
{
if (temp->data == d)
{
cout<<"Tree contains this node"<<endl;
return true;
}
else
{
if (d > temp->data)
{
temp = temp->right;
}
else
{
temp = temp->left;
}
}
}
cout<<"Tree does not contain this node"<<endl;
return false;
}

void BinarySearchTree::insert(int d)
{
tree_node* t = new tree_node;
tree_node* parent;
t->data = d;
t->left = NULL;
t->right = NULL;
parent = NULL;

if(isEmpty()) root = t;
else
{
tree_node* curr;
curr = root;
// Find the Node's parent
while(curr)
{
parent = curr;
if(t->data > curr->data) curr = curr->right;
else curr = curr->left;
}

if(t->data < parent->data)
parent->left = t;
else
parent->right = t;
}
}

//----------------------------------------------------

int main()
{
BinarySearchTree b;
int ch,tmp,tmp1,tmp2;
while(1)
{
cout<<endl<<endl;
cout<<" Binary Search Tree Operations "<<endl;
cout<<" ----------------------------- "<<endl;
cout<<" 1. Insertion/Creation "<<endl;
cout<<" 2. Does Binary Searching Tree contains this node? "<<endl;
cout<<" 3. Exit "<<endl;
cout<<" Enter your choice : ";
cin>>ch;
switch(ch)
{
case 1 : cout<<" Enter Number to be inserted : ";
cin>>tmp;
b.insert(tmp);
break;
case 2 : cout<<" Enter data to be found : ";
cin>>tmp;
b.search(tmp);
break;
case 3 : system("pause");
return 0;
break;
}
}
}

Я попытался переписать это:

#include <process.h>
#include <conio.h>
#include <iostream>
#include <cstdlib>

using namespace std;

template <class T>
class BinarySearchTree
{
private:
struct tree_node
{
tree_node* left;
tree_node* right;
T data;
};
tree_node* root;
public:
BinarySearchTree<T>()
{
root = NULL;
}

T isEmpty() const { return root==NULL; }
T insert(T);
T search(T);

};

//----------------------------------------------------

template <class T>T BinarySearchTree<T>::search(T d)
{
tree_node* temp = root;
while (temp != NULL)
{
if (temp->data == d)
{
cout<<"Tree contains this node"<<endl;
return true;
}
else
{
if (d > temp->data)
{
temp = temp->right;
}
else
{
temp = temp->left;
}
}
}
cout<<"Tree does not contain this node"<<endl;
return false;
}template <class T>T BinarySearchTree<T>::insert(T d)
{
tree_node* t = new tree_node;
tree_node* parent;
t->data = d;
t->left = NULL;
t->right = NULL;
parent = NULL;

if(isEmpty()) root = t;
else
{
tree_node* curr;
curr = root;

while(curr)
{
parent = curr;
if(t->data > curr->data) curr = curr->right;
else curr = curr->left;
}

if(t->data < parent->data)
parent->left = t;
else
parent->right = t;
}
}

//----------------------------------------------------

int main()
{
BinarySearchTree b;
int ch,tmp,tmp1,tmp2;
while(1)
{
cout<<endl<<endl;
cout<<" Binary Search Tree Operations "<<endl;
cout<<" ----------------------------- "<<endl;
cout<<" 1. Insertion/Creation "<<endl;
cout<<" 2. Does Binary Searching Tree contains this node?"<<endl;
cout<<" 3. Exit "<<endl;
cout<<" Enter your choice : ";
cin>>ch;
switch(ch)
{
case 1 : cout<<" Enter Number to be inserted : ";
cin>>tmp;
b.insert(tmp);
break;
case 2 : cout<<" Enter data to be found : ";
cin>>tmp;
b.search(tmp);
break;
case 3 : system("pause");
return 0;
break;
}
}
}