Binary Tree Template Write your own version of a class template that will create a binary...

#include<iostream.h>

#include<conio.h>

using namespace std;

template<class T>

class BinaryTreeTemplate

private:

{

struct tree_node

{

treenode*left;

treenode*right;

}

treenode*root;

public:

binarysearchtree()

{

void insert(T);

void remove(T);

bool search(T);

void preprint();

int count();

}

if(t->data < parent->data)

{

parent->left = t;

}

else
          
parent->right = t;
  
}

template<class T>

void BinarySearchTree<T>

{

tree_node*t=new tree_node;

t->left=null;

t->right=null;

treenode*currentnode;

current=root;

//insertions

//we are using switch cases

switch(ch)

{

case 1:

cout<<“enter the values”;

b.insert();

case 2:

cout<<“enter the data to be removed”;

b.remove();

case 3:

cout<<“enter the searching elements”;

b.search();

case 4:

cout<<“enter the printed data”;

b.print();

case 5:

cout<<“quit”;

b.quit();

return 0;

}

}