Tree.cpp

#include <iostream>

using namespace std;

template <typename T> class Node {
 private:
    T key;
    Node* sx;
    Node* dx;

public:
    Node(const T& key) : key(key) {
        sx = nullptr;
        dx = nullptr;
    }

    Node* get_sx() const {
        return sx;
    }

    Node* get_dx() const {
        return dx;
    }

    const T& get_key() const {
        return key;
    }


    void set_key(const T& key) {
        this->key = key;
    }

    void set_sx(Node* sx){
        this->sx = sx;
    }

    void set_dx(Node* dx){
        this->dx = dx;
    }

    //distruttore

};


template < typename T> class BST {
private:
    Node<T>* rad;
    // h altezza

    void add(Node<T>* nodo, const T& key){
      if(nodo != nullptr && key <= nodo->get_key()){
        if(nodo->get_sx() == nullptr){
            nodo->set_sx(new Node<T>(key));
            return;
        }else{
        add(nodo->get_sx(), key);
        }

      }else{

      if(nodo != nullptr && key > nodo->get_key())
        if(nodo->get_dx() == nullptr){
            nodo->set_dx(new Node<T>(key));
            return;
        }else{
        add(nodo->get_dx(), key);
        }
      }

    }

public:
    BST() : rad(nullptr) {}

    BST(const T& key) {
        rad = new Node<T>(key);
    }

    //inserimento
    void add(const T& key){
        if(rad == nullptr){
            rad = new Node<T>(key);
            return;
        }
    add(rad, key);
    }

};


int main() {
    BST<int>* tree = new BST<int>();

    tree->add(10);
    tree->add(7);
    tree->add(3);
}