2.4 Linked List Implementation in C/C++ | Creation and Display | DSA Tutorials 

long time no see

@@kangmoabel still she is the best the way she teaches,, its unique & efficient enough..

After loop which is one printed for creating list

Mam can u please provide printed code ?....plzz

​@@Mohammed.1471 @SB_Roy_Vlogs #include #include #include struct node{ int data; struct node *next; }; int main(){ struct node *head,*newnode,*temp; int choice=1; head=NULL; while(choice){ newnode=(struct node*)malloc(sizeof(struct node)); printf("Enter node:"); scanf("%d",&newnode->data); newnode->next=NULL; if(head==NULL){ head=newnode; temp=newnode; } else{ temp->next=newnode; temp=newnode; } printf("Enter 1 for continue and 0 for exit:"); scanf("%d",&choice); } temp=head; while(temp!=NULL){ printf("%d->",temp->data); temp=temp->next; } printf("NULL"); getch(); return 0; }

mi amor brasilia

Bro

@@replyingtomemeansyourstupi8996 iam stupid

Great

Which study you were doing which course

Please explain me what is the difference between head pointer and newnode pointer and why malloc is used for only newnode but not head

@@badrip3237 the declaration "struct Node* head = NULL" reserves memory for the pointer variable 'head', it doesn't allocate memory for the 'node' structure itself at this point. the memory for the Node structure is dynamically allocated using the malloc.

thanks

Appreciate it bro

Thanks brother

🔥💥

Doesn't run proberly

Ma'am I have seen many videos of data structures but yours is best 💯thanks a lot for such a best explaination of the concept🙌👍

Mam ne wakai accha tarike se samjhaya hai

Your words are really true bro...

@@pundlikpatil2380 bhai printf scanf ki jgh cout cin ka he to diff hai itna kuch nhi hai same he to hai bro

Kitna paisa mila yeh sab likhne ke liye Bhai

Sir ,in usa how is the scope of IT sector ? Is it has much scope?

GeeksforGeeks is organising mini course of DSA that you should not miss out. Why?? 1. Live QnA sessions, you can clear all doubts related to DSA. Any doubt from LinkedList to Graph. 2. You will get practice problems after every Data structure to make you good at DSA and crystal clear concepts. 3. After completion of course you will get certificate and can access course anytime. 4. Its FREE!!! But only if you use the below code - GFGD4Y2JR Register here- practice.geeksforgeeks.org/courses/Workshop-DSA?loginMode=308

GeeksforGeeks is organising mini course of DSA that you should not miss out. Why?? 1. Live QnA sessions, you can clear all doubts related to DSA. Any doubt from LinkedList to Graph. 2. You will get practice problems after every Data structure to make you good at DSA and crystal clear concepts. 3. After completion of course you will get certificate and can access course anytime. 4. Its FREE!!! But only if you use the below code - GFGD4Y2JR Register here- practice.geeksforgeeks.org/courses/Workshop-DSA?loginMode=308

Ma'am I have a doubt ,I have an error in if(head=newnode->next=0) It seems Id returned 1 exit status.

The same here...bro....😉😉😉

GeeksforGeeks is organising mini course of DSA that you should not miss out. Why?? 1. Live QnA sessions, you can clear all doubts related to DSA. Any doubt from LinkedList to Graph. 2. You will get practice problems after every Data structure to make you good at DSA and crystal clear concepts. 3. After completion of course you will get certificate and can access course anytime. 4. Its FREE!!! But only if you use the below code - GFGD4Y2JR Register here- practice.geeksforgeeks.org/courses/Workshop-DSA?loginMode=308

GeeksforGeeks is organising mini course of DSA that you should not miss out. Why?? 1. Live QnA sessions, you can clear all doubts related to DSA. Any doubt from LinkedList to Graph. 2. You will get practice problems after every Data structure to make you good at DSA and crystal clear concepts. 3. After completion of course you will get certificate and can access course anytime. 4. Its FREE!!! But only if you use the below code - GFGD4Y2JR Register here- practice.geeksforgeeks.org/courses/Workshop-DSA?loginMode=308

Did you get then? Did you pass the course?

😂😂

@@learnersacademybyhaya.345it's been 1 year 😲 , luckily I passed my exam(data structure), it was my 3rd sem subject and currently I am on my final sem(time files like a jet)

@@learnersacademybyhaya.345 yeh, I passed luckily anyway🥹. It was one of my 3rd sem subject

I am also😢😢😢😢

Bhai ye program run hua tha

🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣suma eru da

Me no hablo engles!

this code will node work because you have to assign your choice=1 before while

this helped a lot to me thank you

So clean bro.

hai kis chees ka

I watched first time but something is missing in my head...should watch once more

same here bro......

with do whille it will be executed once and the ask which doesn't affect anything in short it doesn't matter

shuru mai bhi jab ham choice declare kar rhe hai tih bhi shayad choice ki value deni padegi like int choice=1;

Can you please give me the full code? I am also struggling to run it

Veer Beniwal can you send me too, if someone sent you?

#include #include int main() { struct node { int data; struct node *next; }; typedef struct node NODE; int choice=1; NODE *head,*newnode,*temp; head=0; while(choice) { newnode=(NODE *)malloc(sizeof(NODE)); printf("Enter data item "); scanf("%d",&newnode-> data); newnode->next=0; if(head==0) { head=temp=newnode; } else { temp->next=newnode; temp=newnode; } printf("Do you want to continue:(Type 0 or 1)? "); fflush(stdin); scanf("%d",&choice); } temp=head; printf("Linked list items: "); while(temp!=0) { printf("%d ",temp->data); temp=temp->next; } return 0; }

@@aniketmishra8197 Correct, I was thinking that how will it go in while loop already but you have declared choice that is right and instead we can also use do while also , do while will also do right?

bro i have an doubt, y we using NODE.

@@fahimsharuk433 to avoid writing struct node.

#include #include #include using namespace std; struct node{ int data; node *next; }; int count=0; node *head=0,*newnode,*temp; class linked{ public: void createnode(); void traverse(); }; int main(){ int choice; char ch; linked li; do{ cout

Brother can I give code for c I'm unable be execute above code I'm getting errors

@@shonemicheal4935 Can you please provide the complete code of Linked List in C ?

@@mavericks5763 idk c bro

@@mavericks5763 #include #include struct node { int data; struct node *next; }; struct node *head; void beginsert (); void lastinsert (); void randominsert(); void begin_delete(); void last_delete(); void random_delete(); void display(); void search(); void main () { int choice =0; while(choice != 9) { printf(" *********Main Menu********* "); printf(" Choose one option from the following list ... "); printf(" =============================================== "); printf(" 1.Insert in begining 2.Insert at last 3.Insert at any random location 4.Delete from Beginning 5.Delete from last 6.Delete node after specified location 7.Search for an element 8.Show 9.Exit "); printf(" Enter your choice? "); scanf(" %d",&choice); switch(choice) { case 1: beginsert(); break; case 2: lastinsert(); break; case 3: randominsert(); break; case 4: begin_delete(); break; case 5: last_delete(); break; case 6: random_delete(); break; case 7: search(); break; case 8: display(); break; case 9: exit(0); break; default: printf("Please enter valid choice.."); } } } void beginsert() { struct node *ptr; int item; ptr = (struct node *) malloc(sizeof(struct node *)); if(ptr == NULL) { printf(" OVERFLOW"); } else { printf(" Enter value "); scanf("%d",&item); ptr->data = item; ptr->next = head; head = ptr; printf(" Node inserted"); } } void lastinsert() { struct node *ptr,*temp; int item; ptr = (struct node*)malloc(sizeof(struct node)); if(ptr == NULL) { printf(" OVERFLOW"); } else { printf(" Enter value? "); scanf("%d",&item); ptr->data = item; if(head == NULL) { ptr -> next = NULL; head = ptr; printf(" Node inserted"); } else { temp = head; while (temp -> next != NULL) { temp = temp -> next; } temp->next = ptr; ptr->next = NULL; printf(" Node inserted"); } } } void randominsert() { int i,loc,item; struct node *ptr, *temp; ptr = (struct node *) malloc (sizeof(struct node)); if(ptr == NULL) { printf(" OVERFLOW"); } else { printf(" Enter element value"); scanf("%d",&item); ptr->data = item; printf(" Enter the location after which you want to insert "); scanf(" %d",&loc); temp=head; for(i=0;inext; if(temp == NULL) { printf(" can't insert "); return; } } ptr ->next = temp ->next; temp ->next = ptr; printf(" Node inserted"); } } void begin_delete() { struct node *ptr; if(head == NULL) { printf(" List is empty "); } else { ptr = head; head = ptr->next; free(ptr); printf(" Node deleted from the begining ... "); } } void last_delete() { struct node *ptr,*ptr1; if(head == NULL) { printf(" list is empty"); } else if(head -> next == NULL) { head = NULL; free(head); printf(" Only node of the list deleted ... "); } else { ptr = head; while(ptr->next != NULL) { ptr1 = ptr; ptr = ptr ->next; } ptr1->next = NULL; free(ptr); printf(" Deleted Node from the last ... "); } } void random_delete() { struct node *ptr,*ptr1; int loc,i; printf(" Enter the location of the node after which you want to perform deletion "); scanf("%d",&loc); ptr=head; for(i=0;inext; if(ptr == NULL) { printf(" Can't delete"); return; } } ptr1 ->next = ptr ->next; free(ptr); printf(" Deleted node %d ",loc+1); } void search() { struct node *ptr; int item,i=0,flag; ptr = head; if(ptr == NULL) { printf(" Empty List "); } else { printf(" Enter item which you want to search? "); scanf("%d",&item); while (ptr!=NULL) { if(ptr->data == item) { printf("item found at location %d ",i+1); flag=0; } else { flag=1; } i++; ptr = ptr -> next; } if(flag==1) { printf("Item not found "); } } } void display() { struct node *ptr; ptr = head; if(ptr == NULL) { printf("Nothing to print"); } else { printf(" printing values . . . . . "); while (ptr!=NULL) { printf(" %d",ptr->data); ptr = ptr -> next; } } }