Шаблонное бинарное дерево

[sesitos040387s]

здравствуйте,посоветуйте или напишите пожалуйста (код пример) по такой задаче
(необходимо реализовать шаблонное бинарное дерево по коду ниже).

#include "Tree.h"
 
Tree::Tree()
{
    root = nullptr;
}
 
Tree::~Tree()
{
    Del();
}
 
void Tree::Print(Elem* Node)
{
    if (Node != nullptr) {
        Print(Node->left);
        std::cout << Node->var << ' ';
        Print(Node->right);
    }
}
 
Elem* Tree::Search(Elem* Node, int var)
{
    while (Node != nullptr && Node->var != var) {
        if (var < Node->var)
            Node = Node->left;
        else
            Node = Node->right;
    }
    return Node;
}
 
Elem* Tree::Min(Elem* Node)
{
    if (Node != nullptr)
        while (Node->left != nullptr)
            Node = Node->left;
    return Node;
}
 
Elem* Tree::Max(Elem* Node)
{
    if (Node != nullptr)
        while (Node->right != nullptr)
            Node = Node->right;
    return Node;
}
 
Elem* Tree::Previous(Elem* Node)
{
    Elem* y = nullptr;
    if (Node != nullptr) {
        if (Node->left != nullptr)
            return Max(Node->left);
        y = Node->parent;
        while (y != nullptr && Node == y->left)
        {
            Node = y;
            y = y->parent;
        }
    }
    return y;
}
 
Elem* Tree::Next(Elem* Node)
{
    Elem* y = nullptr;
    if (Node != nullptr) {
        if (Node->right != nullptr)
            return Max(Node->right);
        y = Node->parent;
        while (y != nullptr && Node == y->right)
        {
            Node = y;
            y = y->parent;
        }
    }
    return y;
    
}
 
void Tree::Insert(Elem* in)
{
    in->left = nullptr;
    in->right = nullptr;
 
    Elem* y = nullptr;
    Elem* Node = nullptr;
 
    while (Node != nullptr) {
        y = Node;
        if (in->var < Node->var)
            Node = Node->left;
        else
            Node = Node->right;
    }
    in->parent = y;
    if (y == nullptr)
        root = in;
    else if (in->var < y->var)
        y->left = in;
    else
        y->right = in;
}
 
void Tree::Insert(int i)
{
    Elem* in = new Elem;
    in->var = i;
    in->left = nullptr;
    in->right = nullptr;
 
    Elem* y = nullptr;
    Elem* Node = root;
 
    while (Node != nullptr) {
        y = Node;
        if (in->var < Node->var)
            Node = Node->left;
        else
            Node = Node->right;
    }
    in->parent = y;
    if (y == nullptr)
        root = in;
    else if (in->var < y->var)
        y->left = in;
    else
        y->right = in;
}
 
void Tree::Del(Elem* del_el)
{
}
 
Elem* Tree::GetRoot()
{
    return root;
}