How do you implement a binary search tree in multiple languages?

class Node {
  public:
    int key;  //value of the Node
    Node* left; // leftChild (will also be of the Node class)
    Node* right; // rightChild (will also be of the Node class)
    
    Node(int item) // Constructor to initialize a node with given value
    {
        key = item;
        left = NULL;
        right = NULL;
    }
};

class BinarySearchTree {
  Node* root; // The root node
  public:
  BinarySearchTree(int rootValue) { // constructor to initialize Tree and the root node
    root = new Node(rootValue);
  }
  Node* getRoot() { // Getter - gets root node
    return root;
  }
};

// BST Node
class Node {
  public:
  int key;
  Node* left;
  Node* right;
  // Default Constructor
  Node() {
    key = 0;
    left = NULL;
    right = NULL;
  }
  // Parametrized Constructor
  Node(int val) {
    key = val;
    left = NULL;
    right = NULL;
  }
};
// BST Class
class BinarySearchTree {
  private:
  Node * root;
  public:
  BinarySearchTree(int rootValue) {
    root=new Node(rootValue);
  }
  
  Node* getRoot() {
    return root;
  }
  // A utility function to do inorder traversal of BST 
  void inorder(Node *root) { 
    if (root != NULL) { 
      inorder(root->left); 
      cout << root->key << endl; 
      inorder(root->right); 
    } 
  } 
  /* A utility function to insert a new node with given key in BST */
  Node* insert(Node* node, int key) { 
    /* If the tree is empty, return a new node */
    if (node == NULL) return new Node(key); 
    /* Otherwise, recur down the tree */
    if (key < node->key) 
      node->left  = insert(node->left, key); 
    else if (key > node->key) 
      node->right = insert(node->right, key);    
    /* return the (unchanged) node pointer */
    return node; 
  } 
};
// Driver Program to test above functions 
int main() 
{ 
  // Let's create the above Binary Search Tree
  BinarySearchTree BST(6);
  BST.insert(BST.getRoot(), 3); 
  BST.insert(BST.getRoot(), 9); 
  BST.insert(BST.getRoot(), 1); 
  BST.insert(BST.getRoot(), 5); 
  BST.insert(BST.getRoot(), 7); 
  BST.insert(BST.getRoot(), 11);
  // print inoder traversal of the BST 
  BST.inorder(BST.getRoot()); 
  return 0; 
}