Skip to main content

Linked List Data Structure | Insertion at the beginning

Introduction:
In this tutorial we are going to insert a new node at the beginning of the linked list.
There are two important point: first we should have a list and then we have to create a new node.

After creating the linked list and new node we will try to link our new node at the beginning of the list.


code for creating a list:

step1:
For creating the list first of all let's declare the structure of Nodes of the list:

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

step2: write main function:

int main(){

    int n;
    cout<<"enter the number of Nodes:";
    cin>>n;
    struct Node* head = NULL;
    struct Node* temp;
    int m;
    while(n--){
        cout<<"enter the data into nodes:";
        cin>>m;
        if(head==NULL){
            head = new Node();//creating a node
            head->val = m; // assigning value
            head->next=NULL;
            temp=head;//updating temp
        }
        else{
        struct Node *temp1 = new Node();//creating a node
        temp1->val = m;//assigning value
        temp1->next = NULL;
        temp->next = temp1; // linking temp with newly created node(temp1)
        temp=temp1;// shifting temp to newly created node(temp1)
        }
    }
 
}

now we have our list. second step is to create a new node. let's named it "newNode"

struct Node *newNode = new Node(); // after writing this line we have a new node.
newNode->val=7; //let's insert 7 in the value part of this node.
newNode->next = NULL;





Till now we have our linked list and we have our new node. now let's try to insert our newly created node at the beginning of the list.

what we have to do is, in the next field of our newly created node we have to put the address of the head of our linked list(cause head is the first node of the list).

newNode->next = head; // this piece of code will put the address of head node into the next field of newly created node. and this(newNode) will become the first node of the list. and we know that first node should be head. so we will make our newNode head of the list.



head=newNode; // this means now newnode will act as the head of the list.




full code:

#include<bits/stdc++.h>
using namespace std;

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

int main(){

    int n;
    cout<<"enter the number of Nodes:";
    cin>>n;
    struct Node* head = NULL;
    struct Node* temp;
    int m;
    while(n--){
        cout<<"enter the data into nodes:";
        cin>>m;
        if(head==NULL){
            head = new Node();//creating a node
            head->val = m; // assigning value
            head->next=NULL;
            temp=head;//updating temp
        }
        else{
        struct Node *temp1 = new Node();//creating a node
        temp1->val = m;//assigning value
        temp1->next = NULL;
        temp->next = temp1; // linking temp with newly created node(temp1)
        temp=temp1;// shifting temp to newly created node(temp1)
        }
    }

// till now we have created our list. after this we will create our new node .


struct Node *newNode = new Node(); // after writing this line we have a new node.
newNode->val=7; //let's insert 7 in the value part of this node.
newNode->next = NULL;

//now we have our new node also. so let's link it with the list.

newNode->next = head; // this piece of code will put the address of head node into the next field of newly created node.

head = newNode;// this means now newnode will act as the head of the list.

}

so in this post we have created our linked list, we create a new node and then this new node is inserted at the beginning of the list.

if you have any query please comment it down.

best of luck.

next tutorial:


Comments

Post a Comment

Popular posts from this blog

Disjiont Set Union-Find Data Structure | Code In C++

 Introduction:  In this tutorial we are going to write full program of disjoint set union find advance data structure in c++.  Problem Description: Disjoint Set Union (DSU) is an advance data structure, which basically uses in graph algorithms to find cycles. Codes:  Method1: Brute Force #include<bits/stdc++.h> using namespace std; int find(int f,vector<int>&dsuf){     if(dsuf[f]==-1)         return f;     return find(dsuf[f],dsuf); } void union_op(int from, int to, vector<int>& dsuf){     dsuf[from]=to; } bool isCycle(vector<pair<int,int> >&edge_list, vector<int>&dsuf){     for(int i=0;i<edge_list.size();i++){         int parent1=find(edge_list[i].first,dsuf);         int parent2=find(edge_list[i].second,dsuf);         if(parent1==pare...
Post a Comment
Read more

Construct Binary Tree from preorder and inorder | Data Structure

Introduction: In this tutorial we are going to see how we can construct the binary tree from given preorder and inorder. Prerequisites: you should know about binary tree traversal and on paper you can draw binary tree from given preorder and inorder traversal. Inorder:left->root->right; Preorder:root->left->right; Problem Statement: we have given two arrays. one for preorder and another for inorder. by using these two array we have to built a binary tree. eg: preorder = [3,9,20,15,7] inorder = [9,3,15,20,7] solution: Solution: We will follow recursive approach to solve this question.let's discuss how we can solve it. Trick: In the given preorder the very first element will be the root of the tree. then we will find root element in inorder also. and we know in inorder traversal we have left part then root and then right part of the tree. by using preorder we can get the root of the main tree and by using inorder and root we can get the left part and right part of the...
Post a Comment
Read more

Group Anagrams solution with explanation:Leetcode solution

what is Anagrams? suppose we have two strings and the characters present in both of the strings are same. then both will be called anagram of each other. eg:" rat" and "art" both are anagram of each other. the characters present in both string are same. eg: "raat" and "art" these are not anagrams of each other. and the reason is that the frequency of "a" in "raat" is 2. while the frequency of "a" in "art" is 1. so these are not anagrams of each other. in short two strings will be anagram of each other if they have same characters and the count(frequency) of each and every character must be same in both strings. Solution: There are different ways to solve this question, so here we are going to use Hashmap to solve this question. cause whenever there is need to search we should go with the data structure which use balanced binary tress or hashing. and we know that Hashmap  uses balanced binary trees. so using...
Post a Comment
Read more