Импорт класса из C++ в C#

template <class T>
struct Element
{
  int index;
  int value;
  Element<T>* left_element;
  Element<T>* right_element;
  Element<T>* next_element;
  Element<T>* previous_element;
};
 
template <class T>
class __declspec( dllexport ) BinaryTree
{
private:
  Element<T>* top;
  Element<T>* first_element;
  Element<T>* last_element;
  int index_counter;
  //Add for internal operations
  bool Add( Element<T>* new_element );
public:
  BinaryTree();
 
  BinaryTree( const BinaryTree & bt );
 
  bool Add( T new_value );
 
  bool Delete( T deleting_value );
 
  int IndexOf( T searching_value );
 
  BinaryTree<T> Union( const BinaryTree & bt );
 
  BinaryTree<T> Intersect( const BinaryTree & bt );
 
  BinaryTree<T> Except( const BinaryTree & bt );
 
  ~BinaryTree<T>();
 
  //debug
  void Show();
};

generic <class T>
ref class Element
{
  int index;
  int value;
  Element<T>^ left_element;
  Element<T>^ right_element;
  Element<T>^ next_element;
  Element<T>^ previous_element;
};
 
generic <class T>
ref class BinaryTree
{
private:
  Element<T>^ top;
  Element<T>^ first_element;
  Element<T>^ last_element;
  int index_counter;
  virtual  bool Add(Element<T>^ new_element) = 0;
public:
  //BinaryTree();
  //BinaryTree(BinaryTree<T>^ bt ) = 0;
  virtual bool Add(T new_value ) = 0;
  virtual bool Delete(T deleting_value ) = 0;
  virtual int IndexOf(T searching_value ) = 0;
  virtual BinaryTree<T>^ Union(BinaryTree<T>^ bt ) = 0;
  virtual BinaryTree<T>^ Intersect(BinaryTree<T>^ bt ) = 0;
  virtual BinaryTree<T>^ Except(BinaryTree<T>^ bt ) = 0;
  virtual void Show() = 0;
};

struct Element<T>
{
  int index;
  T value;
  Element<T>* left_element;
  Element<T>* right_element;
  Element<T>* next_element;
  Element<T>* previous_element;
};