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->next = NULL;
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:
Good!
ReplyDelete