{"id":16130,"date":"2023-05-09T06:47:17","date_gmt":"2023-05-09T06:47:17","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=16130"},"modified":"2023-05-09T06:49:43","modified_gmt":"2023-05-09T06:49:43","slug":"insertion-at-the-beginning-of-a-singly-linked-list-in-cpp","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/insertion-at-the-beginning-of-a-singly-linked-list-in-cpp\/","title":{"rendered":"Insertion at the Beginning of a Singly Linked List in C++"},"content":{"rendered":"

\"\"<\/p>\n

One of the operations that we may carry out on a Linked List in C++ is Insertion at Beginning. Node and pointer are the two components that make up linked, where the node holds the data and the pointer holds the address of the subsequent node.<\/p>\n

What is a Singly Linked List?<\/h2>\n

A linked list is a linear data structure with several nodes that are linked to one another. Each node has two fields: the data field and the following node’s address. So, in this article, we’ll look at how to implement insertion at the start of a singly linked list in C++. Here is a template for a singly linked list Node that we create.<\/p>\n

Syntax of Linked List<\/strong><\/p>\n

class Node  \n{   \n    int data;  \n    Node *next;  \n};<\/code><\/pre>\n
How to Insert at the Beginning of a Singly Linked List in C++<\/h2>\n
Assume you’ve been given a single linked list.The goal is to place a node at the start of the given linked list. <\/p>\n
For example,<\/strong>
\nInput :<\/strong><\/p>\n
10 \u2212 20 \u2192 30 \u2192 40 \u2192 50\nInsert \u20180\u2019 at the head or beginning of the given linked list.<\/code><\/pre>\n
Output :<\/strong><\/p>\n
0 \u2192 10 \u2192 20 \u2192 30 \u2192 40\u2192 50<\/code><\/pre>\n
It will print the linked list after inserting the node at the beginning of it as
\n0 \u2192 10 \u2192 20 \u2192 30 \u2192 40\u2192 50<\/p>\n
Algorithm for Insertion at the Beginning of a Singly Linked List<\/h3>\n
Below mentioned steps can be followed for insertion at the beginning of a singly linked list.<\/p>\n
    \n
  1. Make a new node using the given data.<\/li>\n
  2. If the linked list’s head is null, set the new node as the linked list’s head and return.<\/li>\n
  3. Set the new node’s next pointer to the current head of the linked list.<\/li>\n
  4. Set the linked list’s head to point to the new node.<\/li>\n
  5. \n
    Return.<\/p>\n
    \"\"<\/p>\n<\/li>\n<\/ol>\n
    Pseudo Code<\/h3>\n
    function insertAtBeginning(data):\n    newNode = Node(data)\n    if head is null:\n        head = newNode\n        return\n    newNode.next = head\n    head = newNode\n    return<\/code><\/pre>\n
    Now let us discuss the code implementation of insertion at the beginning of a singly linked list in C++.<\/p>\n
    Code Implementation in C++<\/h3>\n\t\t\t\t\t\t