The Program in C++ Program to Create & Display 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(int x) {
  Node* temp = new Node();
  temp->data = x;
  temp->next = head;
  head = temp;
}

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

int main() {
  int n, x;
  cout << "Hello Codeauri Family,enter the number of elements here to find out the linked list below: ";
  cin >> n;
  for (int i = 0; i < n; i++) {
    cout << "Well,enter element " <<  i + 1 << " here " << ": ";
    cin >> x;
    insert(x);
  }
  cout << "Okay,the linked list is: ";
  display();
  return 0;
}

Output:

Hello Codeauri Family,enter the number of elements here to find out the linked list below: 3
Well,enter element 1 here : 577
Well,enter element 2 here : 342
Well,enter element 3 here : 643
Okay,the linked list is: 643 342 577

Pro-Tips💡

A struct Node is defined with two members: data to store the element and next to store a pointer to the next node in the list.

A global variable head is declared and initialized to NULL to serve as the head of the linked list.

The insert function takes an integer x as an input, creates a new node temp with x as its data, sets temp->next to head, and updates head to point to temp.

This results in temp becoming the new head of the linked list, with the previous head becoming its next node.

The display function iterates over the linked list and prints the data of each node.

It starts from head and follows the next pointers of each node until temp becomes NULL, which indicates the end of the list.

In the main function, the user is prompted to input the number of elements, n, and then the elements themselves.

The elements are inserted into the linked list using the insert function.

Finally, the list is displayed using the display function.