The Program in C++ Program to insert a new node at the beginning of a Singly Linked List is given below:

#include <iostream>
using namespace std;

struct Node {
  int data;
  Node* next;
};

Node* head = NULL; // global variable, points to the head of the linked list

void insert_at_beginning(int x) {
  Node* temp = new Node();
  temp->data = x;
  temp->next = head;
  head = temp;
}

void print_list(Node* p) {
  while (p != NULL) {
    cout << p->data << " ";
    p = p->next;
  }
  cout << endl;
}

int main() {
  int n, x;
  cout << "Hello Codeauri Family, enter the number of elements here: ";
  cin >> n;
  for (int i = 0; i < n; i++) {
    cout << "Well, enter an element here " << i + 1 << ": ";
    cin >> x;
    insert_at_beginning(x);
  }

  cout << "Do you want to insert another node at the beginning (y/n)? ";
  char choice;
  cin >> choice;
  if (choice == 'y') {
    cout << "Time to enter the number to insert: ";
    cin >> x;
    insert_at_beginning(x);
  }

  cout << "Okay, the linked list is: ";
  print_list(head);
  return 0;
}

Output:

Hello Codeauri Family, enter the number of elements here: 3
Well, enter an element here 1: 456
Well, enter an element here 2: 234
Well, enter an element here 3: 123
Do you want to insert another node at the beginning (y/n)? y
Time to enter the number to insert: 678
Okay, the linked list is: 678 123 234 456

Pro-Tips💡

The program first takes the number of elements (n) to be added to the linked list from the user.

Then, it takes n elements as input and adds them to the linked list by calling the insert_at_beginning() function.

This function creates a new node and updates the head of the linked list to point to the newly created node.

Finally, the program asks the user if they want to insert another node at the beginning of the linked list.

If the user says ‘yes’, the program takes the number to be inserted as input and calls the insert_at_beginning() function again.

The linked list is displayed using the print_list() function, which takes the head of the linked list as a parameter and prints the data of each node in the list.