Skip to main content

Linked List Data Structure | Creation and Traversal

Introduction:
In this tutorial we will create our linked list.

Before writing code let's understand key words related to linked list:

1. Head:

   first node of the linked list is called the head of the list. and this node is most important.

2.Tail:
  
   last node is called the tail of the list which must points to  null.

    

     

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)


        }
    }
    while(head!=NULL){
        cout<<head->val<<" ";
        head=head->next;
    }
}

the first while loop is used for creating the list, you can use for loop also like:
for(int i=1;i<=n;i++){}

and the second for loop is for traversing the created list.

so lets read our main function line by line.

first of all we are taking a variable "n". which is for how many nodes we want in our linked list.

after that we are initializing our Head to NULL. and also taking a temp variable to keep track of head.

now execute the while loop:

During iteration it will check either the head is NULL or not, if it is NULL then first of all create a node using "new" operator of c++. after creating the node push value of "m" into the head->val part and put NULL to head->next part. now temp will also point to the head after writing temp=head; now we can get value of head using temp also.

In the second iteration it will check head is NULL or Not, and this time head is not NULL, cause we have already created head in our previous iteration, so now what we will do is we will create a Node temp1, temp1->val = m and temp1->next=NULL, now main part comes.
we have created temp1. we have a temp variable as well as head. and currently temp is pointing to head. so what we will do is, we will link our temp1 to head (temp). to do this linking first of all we will make temp->next = temp1, it means in the next field of temp, now we have address of temp1. so now temp get linked with temp1 . now temp=temp1, it means we are shifting our temp to newly created node(temp1).
and this will happen until loop executed.

To traverse the list, we will simply run a while loop until head is not becoming NULL.
and after printing the value of head Node we are shifting it to the next node of the list and so on.

if you have any query, just comment your queries i will try to make it more clear.

next tutorial:



Comments

Post a Comment

Popular posts from this blog

Basics of C++ | C++ Tutorial

This is our first tutorial on C++. and there are a lot of features in C++. but we will focus on those part which is beneficial for competitive programming. and after learning new concept we will solve some questions related to those concepts, so that we can use these concepts to solve bigger problems. First of all let's get some theoritical knowledge about C++: 1.C++ is an Object Oriented Programming language(we will explain this point later). 2.It is developed by Bjarne Stroustrup in 1979. 3.C++ is high level language.     What is High level language?      ->they are those language which is machine independent, that means we can compile or run it on any machine.     ->Easy to debug and maintain.     ->Portable. so if any language has these features then we can consider it as a High level language.       eg:C++, Java etc.. 4.C++ provides data security. 5.Main features of C++ is Polymorphism, I...
Post a Comment
Read more

Array vs Linked List

Benefits of Linked List over Array: 1.Deletion and Insertion:  -> Deletion and Insertion in linked is less time consuming over array.    Deletion: if we delete any element from array except last element, then we have to shift all element backward       after the deleted element. so suppose we have an array of 10 integers and if we delete element from index five, then we have to shift element from index 6 to 9 backward. and it will consume more time. while deletion in list is less time consuming. we will see it later. Insertion: if we insert an element in the array except last index, then  we have to shift the remaining element after that index towards right. and it will take more time. while insertion in linked list is much profitable than array. 2.We can dynamically increase the size of the linked list as we allocate memory to nodes at runtime(or dynamically). while in case of array we have to declare it size during writing of code. ...
Post a Comment
Read more

Symmetric Tree | Interview Problem

Introduction: In this tutorial we are going to solve a good question which will clear your doubts on how BFS or level order traversal is useful to solve binary tree problems. this is basically a question from Leetcode, and it is really very good problem to practice BFS. Problem Statement: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: But the following [1,2,2,null,3,null,3] is not: Link : Leetcode Link please make binary tree on paper by the given array above. and you will get a clear picture of the problem. what we are going to do in this problem. Solution: As we know we are going to apply BFS to solve this problem. actually you have to just get one thing to solve this problem. we will perform BFS, but with little change or modification. So first we will store the root->val in a vector or array of the left subtree. and during this we will first insert left child and then ...
Post a Comment
Read more