common btree in pure c++

btree.hpp

template<class T>
class Node
{
private:
	T data;
	Node* left, * right;

public:
	Node()
	{
		left = nullptr;
		right = nullptr;
	}
	Node(const T& data)
	{
		this->data = data;
	}
	~Node()
	{
		if (left != nullptr) delete left;
		if (right != nullptr) delete right;
	}

	Node* get_left()
	{
		return left;
	}
	Node* get_right()
	{
		return  right;
	}
	T get_data()
	{
		return data;
	}

	void add_leaves(Node<T>* left, Node<T>* right)
	{
		this->left = left;
		this->right = right;
	}
};