Insertion at Beginning in Singly Linked List in C++

#include<iostream>
using namespace std;

class Node
{
    public:
    int data;
    Node *next;
};

void insertFront(Node** head, int data){

    Node* new_node = new Node();

    // assign data
    new_node->data = data;
    
    // change the next node of this newNode 
    // to current head of Linked List
    new_node->next = *head;

    // new_node should become the new head of Linked List
    *head = new_node;
    
    cout << "Inserted Item: " << new_node->data << endl;
}

void printList(Node* node){
    
    cout << "\nLinked List : " ;
    
    //as linked list will end when Node is Null
    while(node!=NULL){
        cout << node->data << " "; node = node->next;
    }
    cout << endl;
}

int main(){

    Node* head = NULL;

    insertFront(&head,4);
    insertFront(&head,5);
    insertFront(&head,6);
    insertFront(&head,7);
    insertFront(&head,8);
    insertFront(&head,9);

    printList(head); 
    
    return 0;  
}

#include<iostream>
using namespace std;

class Node
{
    public:
    int data;
    Node *next;
};

class LinkedList
{
    private:
        Node* head;
    public:
        LinkedList() { // constructor
        head = NULL;
    }
        void insertFront(int data);
        void printList();
};

void LinkedList::insertFront(int data){

    Node* new_node = new Node();
    
    // assign data value
    new_node->data = data;
    // change the next node of this new_node 
    // to current head of Linked List
    new_node->next = head;

    // new_node should become the new head of Linked List
    head = new_node;
    
    cout << "Inserted Item: " << new_node->data << endl;
}

void LinkedList::printList(){
    
    Node* node = new Node();
    node = head;
    
    cout << "\nLinked List : " ;
    
    //as linked list will end when Node is Null
    while(node!=NULL){
        cout << node->data << " "; node = node->next;
    }
    cout << endl; } int main() { LinkedList* new_list = new LinkedList(); new_list->insertFront(4);
    new_list->insertFront(5);
    new_list->insertFront(6);
    new_list->insertFront(7);
    new_list->insertFront(8);
    new_list->insertFront(9);

    new_list->printList();
    
    return 0;  
}