Limited Period Offer : 20% Discount on online/offline courses, for more details call/whatsapp

linked list

1 min read
2 years ago By Aniket Prajapati

### Linked List

A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers . This elements can be accessed by pointer traversing.

insert in linked list:

Linked list class which has a datatype and a pointer which has constructor so that it can be called :

code:

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

class Node{
    public:
    int data;
    Node* next;
    
    Node(int data)
    {
        this->data=data;
        this->next=NULL;
    }
};

Node* takeinput()
{
    int data;
    cin>>data;
    Node* head = NULL;
    Node*tail = NULL;
    while(data!=-1)
    {
        Node* newnode=new Node(data);
        if(head==NULL)
        {
            head=newnode;
            tail=newnode;
        }
        else{
            tail->next=newnode;
            tail=tail->next;
        }
        cin>>data;
    }
    return head;
}

Node* insert(Node* head)
{
    int n;
    cin>>n;
    int data=4;
    Node* temp=head;
    Node* temp1;
    while(n>1)
    {
        temp=temp->next;
        n--;
    }
    temp1=temp->next;
    Node* newnode=new Node(data);
    temp->next=newnode;
    newnode->next=temp1;
    
    
    return head;
}

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

int main()
{
    Node*head=takeinput();
    print(head);
    Node* a=insert(head);
    print(a);
}
Take input in linked list:

The take input function in a linked list runs in O(N) time complexity where N is the number of elements in the linked list. code

Node* takeinput()
{
    int data;
    cin>>data;
    Node* head = NULL;
    Node*tail = NULL;
    while(data!=-1)
    {
        Node* newnode=new Node(data);
        if(head==NULL)
        {
            head=newnode;
            tail=newnode;
        }
        else{
            tail->next=newnode;
            tail=tail->next;
        }
        cin>>data;
    }
    return head;
}
Jul 24, 2023 10:12 Back to Articles

Other Articles

Prim's Algorithm

Prim's Algorithm is a graph algorithm and this algorithm works as it starts with a single node and then moves through several adjacent nodes form that node , in order to explore all of the connected edges along the way.

2 years ago By Aniket Prajapati
What is Agile Development ? What is Agile Development ?

Agile development is a software development approach that emphasizes flexibility, collaboration, and continuous delivery. It involves iterative development, continuous feedback, a collaborative approach, adaptability, and continuous improvement.

2 years ago By Mitali Gupta
For Laravel Setting UP CI/CD Pipeline using GitHub, CodeDeploy, S3 and EC2

Setting ci/cd pipeline for laravel application on aws using github actions then uploading to s3 and using codedeploy application gets installled on EC2 instance

2 years ago By Santosh Kshirsagar
How to connect aws RDS instance using mysql workbench

Learn to connect RDS instance(mysql/mariadb) using mysql workbech.

2 years ago By Santosh Kshirsagar