Single Linked List (Inserting a Node at a Certain Position)

Data Structures: Inserting a Node at a certain position in a Singly Linked List
Topics discussed:
1) Adding a node in a Singly Linked List to a certain position.
2) C program for inserting a node at a certain position in case of the Singly Linked List.
C Programming Lectures: goo.gl/7Eh2SS
Follow Neso Academy on Instagram: @nesoacademy(bit.ly/2XP63OE)
Follow me on Instagram: @jaspreetedu(bit.ly/2YX26E5)
Contribute: www.nesoacademy...
Memberships: bit.ly/2U7YSPI
Books: www.nesoacademy...
Website ► www.nesoacademy...
Forum ► forum.nesoacade...
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#DataStructuresByNeso #DataStructures #LinkedList #SingleLinkedList

[@bbennyjoseph8589]

This is the best site to learn Data Structures. I've been searching many online sites to get this topic clear But I couldn't find any. But this is the best site to learn. Thank you Sir you are explaining in a very understandable way.

[@user-zo9ye6de5e]

uploading speed is super slow

[@kumarishivangi3792]

Same ❤️🤞

[@miss_queen-yf6bv]

if you get confused in the while loop then can follow these steps pos - - ; while(i < pos) { ptr = ptr-> next ; i++ ; } // initialize i at beginning where i = 1

[@suvamoyghorai5247]

What if I use While (i

[@binduaradhya3514]

I have been struggling so much for the past few hours understanding this topic....n u explained it so well......thank you so much

[@RaviSingh-fr2qh]

hey! can you tell me why sir has done pos--, before using while loop

[@nikitamittal3559]

@@RaviSingh-fr2qh To traverse the list & to update the ptr->link value till the desired address after which node needs to be inserted.

[@Ne0n425]

I have been attending my DSA lectures for the past two weeks with a blank mind. However, after watching your videos, this topic seems much easier and more interesting. Performing different operations on it now feels achievable. You nailed it bro!

[@hallucinat0ry]

With a blank mind, that got me🤣🤣. I still continuing in blank..wishing all at once would trigger at some point.

[@herohera3497]

what r u learning now?

[@hallucinat0ry]

@@herohera3497 i know nothin.

[@RaviShankar-ow9pu]

Thanku. Sir, U r god for me, who has made my concept so clear...

[@kajalmondal9745]

Now it's time solve Gate previous year questions. ....

[@indian1747]

But coding part is not asked in gate

[@steventalik4782]

Thank you so much for making your videos. My C program professor did a terrible job teaching this concept and I paid for the class. I understand it so much more with your videos so thank you.

[@vishalprajapati6154]

Thanks for uploading this master piece ❤

[@muhammadshahab5749]

Great job and i am expecting from you complete data structure Series like Trees Stack Queue U R the Great Explainer 👍👍👍

[@omkarbhanushali1658]

Yes plz upload the video lectures of queue stack and tree also ...plz it's great request from us 🙏

[@muhammadshahab5749]

@@omkarbhanushali1658 Yes budy🥂🥂

[@nikitamittal3559]

Below is the Universal Code that works for all the positions including the position=1. We need to give separate condition for 1st position. #include #include struct node{ int data; struct node *link; }; struct node *add_at_end(struct node *ptr, int data){ struct node *temp= malloc(sizeof(struct node)); temp->data = data; temp->link = NULL; ptr->link = temp; return temp; } void add_at_pos(struct node **head, int data, int pos){ struct node *ptr = *head; struct node *ptr2 = malloc (sizeof(struct node)); ptr2->data = data; ptr2->link = NULL; if(pos==1) { ptr2->link=ptr; *head=ptr2; } else { pos--; while(pos != 1){ ptr = ptr->link; pos--; } ptr2->link = ptr->link; ptr->link = ptr2; } } int main() { struct node *head = malloc(sizeof(struct node)); head->data = 45; head->link = NULL; struct node *ptr = head; ptr= add_at_end(ptr, 98); ptr= add_at_end(ptr, 3); ptr= add_at_end(ptr, 88); ptr = head; int data = 76, position =1 ; add_at_pos(&head, data, position); struct node *ptr1 = head; while(ptr1 != NULL){ printf("%d ", ptr1->data); ptr1=ptr1->link; } return 0; }

[@rahmansaif4087]

Brother,thanks a lottt ❤

[@shobanajohn9743]

Thank you

[@user-wi8zd8xv5d]

"Hey bro, you're the real OG! Thanks a lot!"

[@vasilvasilev6225]

this DS course is simply ingenious ... admirations

[@hiteshmahi]

at 6:11 , In second node the link part should contain address 4000. Otherwise very nice explanation.

[@gamingharsh21]

This is fantastic video your video solve my doubt thank you

[@domrajdanny7416]

Really helpful

[@aniketjagtap2143]

sir you make the dsa more interested !👍

[@muaazulhassan1721]

This video helped me a lot, Thank you very much!

[@srikantabanerjee1547]

Sir what if the pos is 1.. that means we need to insert at beginning of the ll?

[@dipeshsamrawat7957]

I love Neso Academy. 💝

[@guitarkeen4256]

Isnt there a mistake? 5:57 node with data 98 should contain link to 4000

[@lighthouse18]

yes

[@anniamatthews6803]

this was great thank you

[@Shaziya_786]

just wonderful explanation

[@draganjelic3549]

Thank you very much, you helped me a lot!

[@babysuyash]

I think the code fails if we insert the position as 1 cause pos-- will be 0 and then it missed the position or goes on infinte loop... correct me if I am wrong ?

[@gamar1226]

yes, you will have a segmentaion fault

[@annayatsenko379]

@@gamar1226 so how to fix it?

[@punky6320]

Thank you so much sir! You have good teaching skill ! You deserved for likes and subscribes!

[@nithyashree6746]

Thanks bro❤

[@faizzamir3965]

Please don't stop this ❤❤

[@dominiquefortin5345]

The use of a caboose is another way and it simplifies all the code. struct node *createList() {struct node *nd = malloc(sizeof(struct node)); nd->link = nd; return nd;}; void insertBefore(struct node *nd, int new_data) {struct node *new_nd = malloc(sizeof(struct node)); new_nd->link = nd->link; new_nd->data = nd->data; nd->link = new_link; nd->data = new_data;}; Now all the other functions get simplified : void add_beg(struct node *head, int new_data) {insertBefore(head, new_data);}; void add_at_end(struct node *head, int new_data) {struct node *nd = head; while (nd->link != nd) {nd = nd->link;}; insertBefore(nd, new_data);}; void add_at_position(struct node *head, int new_data, in pos) {struct node *nd = head; --pos; while (nd->link != nd && pos > 0) {nd = nd->link; --pos;}; insertBefore(nd, new_data);};

[@mayuritare5511]

Thank u sir, you explained this topic very easily👏

[@sudeepmulumudi]

do more videos ,,,,very helpful to me

[@raghavaulli437]

instead using while we can use for loop it is easy to traverse

[@kumarishivangi3792]

Can you please upload more videos.. covering all topics of dsuc... I promise I will share this channel and videos among my friends 🤞❤️ please please... Apke alawa meko kahi ni samajh aya.. please

[@pranathikodicherla3283]

Sir, why does add at end function have head as parameter? The one you wrote in last class took another variable ptr which was updated each time. In this program the link between the first and second nodes is lost right?

[@punky6320]

#include using namespace std; struct node{ int data; node *next; }; void add_at_end(node *head, int d){ node *ptr, *temp; temp = new node; temp->data = d; temp->next = NULL; ptr = head; while(ptr->next != NULL){ ptr = ptr->next; } ptr->next = temp; } void add_at_pos(node *head, int data, int pos){ node *ptr = head; node *ptr2 = new node; ptr2->data = data; ptr2->next = NULL; pos--; while(pos != 1){ ptr = ptr->next; pos--; } ptr2->next = ptr->next; ptr->next = ptr2; } int main() { node *head = new node; head->data = 45; head->next = NULL; add_at_end(head, 98); add_at_end(head, 3); int data = 67, position = 3; add_at_pos(head, data, position); node *ptr = head; while(ptr != NULL){ cout

[@gamingwithindian8492]

#include #include struct node { int data; struct node *link; }; void add_at_end(struct node *head, int d) { struct node *ptr, *temp; temp = (struct node*)malloc(sizeof(struct node)); temp->data = d; temp->link= NULL; ptr = head; while(ptr->link != NULL) { ptr = ptr->link; } ptr->link = temp; } void add_at_pos(struct node* head,int data,int pos) { struct node *ptr = head; struct node *ptr2 = malloc(sizeof(struct node)); ptr2->data = data; ptr2->link = NULL; pos--; while(pos != 1) { ptr=ptr->link; pos--; } ptr2->link = ptr->link; ptr->link = ptr2; } int main() { struct node *head = malloc(sizeof(struct node)); head->data = 45; head->link = NULL; add_at_end(head,98); add_at_end(head,3); int data = 67; int position = 3; add_at_pos(head, data, position); struct node *ptr = head; while(ptr != NULL) { printf("%d ", ptr->data); ptr = ptr->link; } return 0; }

[@user-cd8cg3yr1q]

@@punky6320 thanks man , code was really helpfull .

[@samikshabijwe7403]

if we generalize this code for any other linked list, then can we write while(pos!=pos-1) and then the remaining code?

[@saketkumar7335]

Sir, very eager for upcoming videos on data structure.

[@fadi551000]

void inseertPos(node* head, int value, int pos) { node* new_node = new node; new_node-> data = value; node* ptr = pos - 1; now_node -> next = ptr -> next; ptr -> next = new_node; } //how is that ?

[@arunkumarr2302]

Amazing 👍🏻

[@debuti]

The code has an obvious flaw. What if I want to insert into the pos 1?

[@shashankkumar851]

Another logic if anyone is unable to get the head around in the above video:- void add_at_pos(struct node *head, int pos, int value) { struct node *temp = (struct node *)malloc(sizeof(struct node)); struct node *ptr = head; temp->data = value; int p = 1; while (p != (pos - 1)) { ptr = ptr->next; p++; } temp->next = ptr->next; ptr->next = temp; }

[@chs649]

Thanks man. 🤝🏻

[@indanadeevena4597]

Add at end function calling has been changed ...in previous lecture you have called ptr and data..I.e you returned the ptr valu to main function 🧐could you show me the whole program

[@thereisnoname0859]

sir, if you help me, I will be appreciated . I tried to do it with a counter. For example, when counter == position, add insert node but it doesn't work. Can u help me?

[@alikoohi4821]

thank you for the explanation. Can I ask if I want it to be in second position the while loop condition should be while( pos != 0) ?

[@shrutimagdum9685]

Sir you have used add_at_end(head,98) but where is the code for updating address of first node because initially it will be null .I have seen previous video where you have written code for inserting a t end but there was a pointer temp so could update address of first node but here there is nothing such ,what we need to do ?

[@GaneshKumar-vh4it]

is it necessary to know position well in advance or it can be given by the user during run time?? if position is known we can implement the function based on that position ,if position is given by the user then how to implement a generalised code .

[@followthewhiterabbit7559]

You will read the position from the user and then you will traverse between the nodes until you reach the place you want to put your new node. Let's say, the input is given as 4, 4th node to be particular, then you will traverse 4 - 1 times but not including the last node so the code will traverse 2 times for the fourth node for (int i = 1; i < pos - 1; i++) // { // check if the current temp is not null and move until you find the node to be linked your newly created node }

[@_txt_7398]

My exam is today :)

[@_txt_7398]

My logic : void Add_at_pos( struct node *head,int data,int pos){ struct node *temp = malloc(sizeof(struct node)); temp -> data = data; temp -> next = NULL; struct node *ptr = head; for(int i=1 ; i next; } temp -> next = ptr -> next; ptr -> next = temp; }

[@nguyenan9181]

can I use this function to insert at the beginning?

[@_nabin_8848]

@@nguyenan9181 no u can't

[@user-eg3yh6yk8e]

Sorry sir,Incase I have a new node like yours let say node 5and I want to join it somewhere at,the end,the beginning,and after second node. Mention pointers which will be involved in each

[@IM4fLEX]

Thanks bhai

[@mdikbalhosen1711]

what is the condition for inserting at position 1?

[@rinilkr3684]

Nice class

[@anishgupta8938]

Is it possible to calculate the insert position in the main function itself, and pass ptr as the reference node while not having to pass the additional positional parameter to the insert function?

[@mallinaprudhvi4066]

Why are we not returning the values from the functions to the main function, even though we are using call by value....... Plz respond if anyone aware of it.

[@mohd.saifshaikh2028]

Basically it is calling by value but that value which is being passed is the adress only so that's why we are not returning . ...take an example we are passing head means the value of head i .e the adress only

[@harshalkumar4538]

what if the user decide to add the node at the beginning of the linked list? wouldn't the head of the linked list get messed up?

[@nikitamittal3559]

Below is the Universal Code that works for all the positions including the position=1. We need to give separate condition for 1st position. #include #include struct node{ int data; struct node *link; }; struct node *add_at_end(struct node *ptr, int data){ struct node *temp= malloc(sizeof(struct node)); temp->data = data; temp->link = NULL; ptr->link = temp; return temp; } void add_at_pos(struct node **head, int data, int pos){ struct node *ptr = *head; struct node *ptr2 = malloc (sizeof(struct node)); ptr2->data = data; ptr2->link = NULL; if(pos==1) { ptr2->link=ptr; *head=ptr2; } else { pos--; while(pos != 1){ ptr = ptr->link; pos--; } ptr2->link = ptr->link; ptr->link = ptr2; } } int main() { struct node *head = malloc(sizeof(struct node)); head->data = 45; head->link = NULL; struct node *ptr = head; ptr= add_at_end(ptr, 98); ptr= add_at_end(ptr, 3); ptr= add_at_end(ptr, 88); ptr = head; int data = 76, position =1 ; add_at_pos(&head, data, position); struct node *ptr1 = head; while(ptr1 != NULL){ printf("%d ", ptr1->data); ptr1=ptr1->link; } return 0; }

[@ayoubferdjani8097]

I liked

[@reverbism]

thank you 8/04/2022 at 1:08 am

[@raviprakashmishra2860]

jaldi jaldi dalo sir pls pls jaldi jaldi dalo sir pls pls jaldi jaldi dalo sir pls pls jaldi jaldi dalo sir pls pls jaldi jaldi dalo sir pls pls

[@harshalkumar4538]

boht hawsi ho yaar tum

[@rajendrasarswat9127]

don't I need to return head from add_at_pos function?

[@nimishsahu9902]

what about inserting at position = 0; how to insert at begining using this metho ?

[@___vijay___]

Another Logic : for (i = 0; i < pos - 2; i++) { ptr = ptr->link; }

[@prateekjain7785]

Thanks bro

[@hetaeramancer]

my logic: int count = 2; while((*temp).link != NULL) { temp = (*temp).link; count++; if(count == position) break; } haha i know it's rushed and not that well-written

[@mehmedkukavica8076]

I only miss comments in code to say perfect!

[@Mrmokuplays]

Thanku sir acha smjhaya.

[@ishtiaqurrahman-fc9go]

why u don't use return function??

[@_nabin_8848]

if you want to insert element at first position you can check the code: #include #include typedef struct node{ int data; struct node* link; }node; void out(node* p){ while(p!=NULL) { printf("%d\t",p->data); p=p->link; } } void add_node(node** p, int data) { node* temp= (node*)malloc(sizeof(node)); temp->link=NULL; temp->data=data; (*p)->link=temp; *p=temp; } void clear(node* p){ node* ptr=p; while(p!=NULL) { p=p->link; free(ptr); ptr=p; } } void add_node_certain(node** ptr, int pos,int data){ node* temp=(node*)malloc(sizeof(node)); temp->link=NULL; temp->data=data; if(pos!=1) { node* p=(*ptr); int i; for(i=1;ilink; temp->link=p->link; p->link=temp; } else { temp->link=*ptr; *ptr=temp; } } int main() { node* head=(node*)malloc(sizeof(node)); head->link=NULL; head->data=10; node* ptr=head; add_node(&ptr,20); add_node(&ptr,30); add_node(&ptr,40); ptr=head; add_node_certain(&head,1,999);//second argument=position and third argument =value; ptr=head; out(ptr); }

[@lawrencemuthui]

Clear function will not get executed...add a call function to clear at the end of main function

[@___vijay___]

What if the user entered position 1! Will it work?

[@anishgupta8938]

The loop: while(pos != 1) { ptr = ptr -> next; pos--; } will not be executed since the condition does not match on the first iteration. Therefore, no changes will be made to ptr, which is, by default, on reference head. Thus it will append to the beginning of the list

[@tarunjoshi9532]

sir isme apne 98 k link main 3000 dala hai jbki uske next ka address 4000 hai 67 pr 3000 hai ar uske next k link ka address 3000 hai sir so its conflict i think that can you recheck that 6:12 min.

[@IShowwSpeedsui]

Better than Jenny's

[@rimpinag6346]

Sir here you use that code ,is that code full program of insert a node at any position??? Plz reply that

[@punky6320]

#include using namespace std; struct node{ int data; node *next; }; void add_at_end(node *head, int d){ node *ptr, *temp; temp = new node; temp->data = d; temp->next = NULL; ptr = head; while(ptr->next != NULL){ ptr = ptr->next; } ptr->next = temp; } void add_at_pos(node *head, int data, int pos){ node *ptr = head; node *ptr2 = new node; ptr2->data = data; ptr2->next = NULL; pos--; while(pos != 1){ ptr = ptr->next; pos--; } ptr2->next = ptr->next; ptr->next = ptr2; } int main() { node *head = new node; head->data = 45; head->next = NULL; add_at_end(head, 98); add_at_end(head, 3); int data = 67, position = 3; add_at_pos(head, data, position); node *ptr = head; while(ptr != NULL){ cout

[@Shalinity]

@@punky6320 thanks:)

[@educationalonly5941]

Yes

[@prodiptaghosh6809]

Sir next video is private why ??

[@nesoacademy]

It was scheduled for 8 PM, now it is public.

[@prodiptaghosh6809]

@@nesoacademy OOH THANK YOU SIR

[@mattmen]

I have a question respecting the update of the links (step 3) Why would this won't work? I have checked it and it doesn't even add the new link in any position :( ptr2 -> link = ptr ; ptr = ptr2 ; Thks in advance!!!

[@mattmen]

**by adding the new link i meant the new node sorry for that haha. Cheers!

[@mattmen]

I'm having trouble understanding why is necessary to reference the link of some node instead of the node itself Like we did in the lecture with the function "addAtTheBeginning"

[@punky6320]

#include using namespace std; struct node{ int data; node *next; }; void add_at_end(node *head, int d){ node *ptr, *temp; temp = new node; temp->data = d; temp->next = NULL; ptr = head; while(ptr->next != NULL){ ptr = ptr->next; } ptr->next = temp; } void add_at_pos(node *head, int data, int pos){ node *ptr = head; node *ptr2 = new node; ptr2->data = data; ptr2->next = NULL; pos--; while(pos != 1){ ptr = ptr->next; pos--; } ptr2->next = ptr->next; ptr->next = ptr2; } int main() { node *head = new node; head->data = 45; head->next = NULL; add_at_end(head, 98); add_at_end(head, 3); int data = 67, position = 3; add_at_pos(head, data, position); node *ptr = head; while(ptr != NULL){ cout

[@user-mx9fq5kq3p]

At some positions of video making is not in a clear view please retify it

[@junwooabbei487]

there's an issue if we want to insert at position 1

[@adarshsingh1823]

Sir what is the logic behind decrementing pos i.e pos--; I couldn't understand why you are decreasing this value.? we are given a node to be inserted at pos 3. Then y u are decreasing it?

[@nikitamittal3559]

To traverse the list & to update the ptr->link value till the desired address after which node needs to be inserted.

[@abhishekshankar6305]

what if we want to insert the node at position 1 (just after head)

[@ihateracistandblackpeople4272]

If you mean position 2 then it'll be fine

[@carlossantamaria1820]

@@ihateracistandblackpeople4272 but what if i want to insert a node at the beggining? i can't

[@ihateracistandblackpeople4272]

@@carlossantamaria1820 Then u have to redirect the code to another function for this specific condition containing command to insert a node at first location which neso academy have made a video on.

[@carlossantamaria1820]

@@ihateracistandblackpeople4272 oh,ty, I thought this was going to work in this code as well

[@ihateracistandblackpeople4272]

@@carlossantamaria1820 np

[@anirudhbukka5413]

A slower paced and lesser hurried explanation would be great, otherwise the content is good

[@luckytiwari878]

code given in video are showing a lot of error after compilation..? is given code is correct??

[@punky6320]

#include using namespace std; struct node{ int data; node *next; }; void add_at_end(node *head, int d){ node *ptr, *temp; temp = new node; temp->data = d; temp->next = NULL; ptr = head; while(ptr->next != NULL){ ptr = ptr->next; } ptr->next = temp; } void add_at_pos(node *head, int data, int pos){ node *ptr = head; node *ptr2 = new node; ptr2->data = data; ptr2->next = NULL; pos--; while(pos != 1){ ptr = ptr->next; pos--; } ptr2->next = ptr->next; ptr->next = ptr2; } int main() { node *head = new node; head->data = 45; head->next = NULL; add_at_end(head, 98); add_at_end(head, 3); int data = 67, position = 3; add_at_pos(head, data, position); node *ptr = head; while(ptr != NULL){ cout

[@nikitamittal3559]

@@punky6320 Below is the Universal Code that works for all the positions including the position=1. We need to give separate condition for 1st position. #include #include struct node{ int data; struct node *link; }; struct node *add_at_end(struct node *ptr, int data){ struct node *temp= malloc(sizeof(struct node)); temp->data = data; temp->link = NULL; ptr->link = temp; return temp; } void add_at_pos(struct node **head, int data, int pos){ struct node *ptr = *head; struct node *ptr2 = malloc (sizeof(struct node)); ptr2->data = data; ptr2->link = NULL; if(pos==1) { ptr2->link=ptr; *head=ptr2; } else { pos--; while(pos != 1){ ptr = ptr->link; pos--; } ptr2->link = ptr->link; ptr->link = ptr2; } } int main() { struct node *head = malloc(sizeof(struct node)); head->data = 45; head->link = NULL; struct node *ptr = head; ptr= add_at_end(ptr, 98); ptr= add_at_end(ptr, 3); ptr= add_at_end(ptr, 88); ptr = head; int data = 76, position =1 ; add_at_pos(&head, data, position); struct node *ptr1 = head; while(ptr1 != NULL){ printf("%d ", ptr1->data); ptr1=ptr1->link; } return 0; }

[@gamingwithindian8492]

#include #include struct node { int data; struct node *link; }; void add_at_end(struct node *head, int d) { struct node *ptr, *temp; temp = (struct node*)malloc(sizeof(struct node)); temp->data = d; temp->link= NULL; ptr = head; while(ptr->link != NULL) { ptr = ptr->link; } ptr->link = temp; } void add_at_pos(struct node* head,int data,int pos) { struct node *ptr = head; struct node *ptr2 = malloc(sizeof(struct node)); ptr2->data = data; ptr2->link = NULL; pos--; while(pos != 1) { ptr=ptr->link; pos--; } ptr2->link = ptr->link; ptr->link = ptr2; } int main() { struct node *head = malloc(sizeof(struct node)); head->data = 45; head->link = NULL; add_at_end(head,98); add_at_end(head,3); int data = 67; int position = 3; add_at_pos(head, data, position); struct node *ptr = head; while(ptr != NULL) { printf("%d ", ptr->data); ptr = ptr->link; } return 0; }

[@dhairyashah5886]

what if we want to instert at position 1?

[@followthewhiterabbit7559]

then the newly created node's linker variable (next) will point to the previous head address and the previous head address will be set to the newly created array's address.

[@accessdenied9393]

I think that we just need one pointer (double pointer); void insert_at_pos(node** traverse, int pos, int data) { while (pos--) { if (!pos) { node *newnode = malloc(sizeof(node)); newnode->data = data; newnode->ptr = NULL; newnode->ptr = *traverse; *traverse = newnode; } else traverse = &(*traverse)->ptr; // &(head->ptr) } }

[@sonaliverma5406]

This program is not working properly when I take pos=1

[@gamingwithindian8492]

#include #include struct node { int data; struct node *link; }; void add_at_end(struct node *head, int d) { struct node *ptr, *temp; temp = (struct node*)malloc(sizeof(struct node)); temp->data = d; temp->link= NULL; ptr = head; while(ptr->link != NULL) { ptr = ptr->link; } ptr->link = temp; } void add_at_pos(struct node* head,int data,int pos) { struct node *ptr = head; struct node *ptr2 = malloc(sizeof(struct node)); ptr2->data = data; ptr2->link = NULL; pos--; while(pos != 1) { ptr=ptr->link; pos--; } ptr2->link = ptr->link; ptr->link = ptr2; } int main() { struct node *head = malloc(sizeof(struct node)); head->data = 45; head->link = NULL; add_at_end(head,98); add_at_end(head,3); int data = 67; int position = 3; add_at_pos(head, data, position); struct node *ptr = head; while(ptr != NULL) { printf("%d ", ptr->data); ptr = ptr->link; } return 0; }

[@merajbaig283]

T̤h̤a̤n̤k̤s̤ f̤o̤r̤ h̤a̤r̤d̤ w̤o̤r̤k̤s̤ s̤i̤r̤

[@s_4589]

this doesn't work if position is 1

[@punky6320]

#include using namespace std; struct node{ int data; node *next; }; void add_at_end(node *head, int d){ node *ptr, *temp; temp = new node; temp->data = d; temp->next = NULL; ptr = head; while(ptr->next != NULL){ ptr = ptr->next; } ptr->next = temp; } void add_at_pos(node *head, int data, int pos){ node *ptr = head; node *ptr2 = new node; ptr2->data = data; ptr2->next = NULL; pos--; while(pos != 1){ ptr = ptr->next; pos--; } ptr2->next = ptr->next; ptr->next = ptr2; } int main() { node *head = new node; head->data = 45; head->next = NULL; add_at_end(head, 98); add_at_end(head, 3); int data = 67, position = 3; add_at_pos(head, data, position); node *ptr = head; while(ptr != NULL){ cout

[@educationalonly5941]

Yes I also tried but it was giving infinite loop

[@nikitamittal3559]

@@educationalonly5941 Below is the Universal Code that works for all the positions including the position=1. We need to give separate condition for 1st position. #include #include struct node{ int data; struct node *link; }; struct node *add_at_end(struct node *ptr, int data){ struct node *temp= malloc(sizeof(struct node)); temp->data = data; temp->link = NULL; ptr->link = temp; return temp; } void add_at_pos(struct node **head, int data, int pos){ struct node *ptr = *head; struct node *ptr2 = malloc (sizeof(struct node)); ptr2->data = data; ptr2->link = NULL; if(pos==1) { ptr2->link=ptr; *head=ptr2; } else { pos--; while(pos != 1){ ptr = ptr->link; pos--; } ptr2->link = ptr->link; ptr->link = ptr2; } } int main() { struct node *head = malloc(sizeof(struct node)); head->data = 45; head->link = NULL; struct node *ptr = head; ptr= add_at_end(ptr, 98); ptr= add_at_end(ptr, 3); ptr= add_at_end(ptr, 88); ptr = head; int data = 76, position =1 ; add_at_pos(&head, data, position); struct node *ptr1 = head; while(ptr1 != NULL){ printf("%d ", ptr1->data); ptr1=ptr1->link; } return 0; }

[@aeroabrar_31]

@@nikitamittal3559 Thanks a lot buddy ,this covers all the previous lectures....❤💖✌