BST Inorder

int inorder(Node* node){
    int counter = 0;
    if(node != NULL){
        counter++;
        counter += inorder(node->left);
        std::cout<<node->key<<std::endl;
        counter += inorder(node->right);
    }
    return counter;
}