Single Linked List (Deleting the Node at a Particular Position)

Data Structures: Deleting the Node of a Singly Linked List at a Specified Position.
Topics discussed:
1) C program to delete the node of a singly linked list present at a particular position.
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.org/donate
Memberships: bit.ly/2U7YSPI
Books: www.nesoacademy.org/recommende...
Website ► www.nesoacademy.org/
Forum ► forum.nesoacademy.org/
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#DataStructuresByNeso #DataStructures #LinkedList #SingleLinkedList

[@bhavyabhagwani5407]

This is a blessing to us who are not having any classes to study! Brilliant teaching literally! Also please complete the series, trees graphs and everything

[@krishnakumarjha1236]

Thank you for this. Brilliant as always.

[@Jeremyak]

Neso puts out the highest quality videos I have been able to find on these topics, this is the type of instruction one would expect to find in a college course that you paid too much money for, but in reality it's better than 95% of them. Thank you sir, God bless.

[@khabibali4967]

Sir, Honestly speaking I have no words that I explain your vast knowledge about Data Structure on KZbin But unfortunately, I couldn't find a complete series on data structure

[@PrasunNath]

Thanks a lot , i was stuck at this topic, now i am completely satisfied, thanks again

[@asaadhabibkhan8420]

thank U very much sir............ really helped a lot when I had an assignment to submit in 3 hours........

[@eva42sh]

This is the best site to learn Data Structures.

[@shilpakumari1149]

U r just awesome And your teaching style is best😊

[@pulastyadas3351]

Much awaited

[@pulastyadas3351]

Thanks a lot 🙏🙏🙏 keep uploading

[@saidhakshan4447]

best linked list tutorials ever.

[@rahulkumar_317]

@neso acedmy It is very helpful for us... Please upload the remained topic ..

[@dipeshsamrawat7957]

I love Neso Academy. 💝

[@Ankit-mh1qx]

Pls upload daily & cover whole series of dsa

[@syedsulaiman8380]

This channel is HUGLEY underrated

[@utkarshgupta7517]

Pastly watches 3 videos on it but was still not getting, this one has made it clear

[@hi-xu5ee]

Sir plz upload the remaining portion of the data structures because it is to helpful 🙏🙏🙏🙏🙏

[@pulastyadas3351]

Sir,Please upload double linked list , stack , queue as soon as possible 🙏🙏🙏 this will help us to prepare for placement this year

[@nesoacademy]

Sure.

[@karimabou6493]

And also trees please

[@sambitmishra129]

@@nesoacademy sir I could able to learn c only bcz of u sir. Plz 🙏 upload the rest of topic of dsa as soon as possible,it will be a great help for students.....❤️ The way you have explained the things nobody can explain that way .very easy & to the point & the example in chapter just brush up the knowledge of the topic to the next level.....sir plz 🙏 🙏 give a lot of examples with explanation to make things more easier..... Thank u sir u r great help ❤️❤️❤️

[@kajalmondal9745]

Jaspreet Sir, i am facing too much problem to tackle the recursion problems. What should i do now please reply? (I watched your all videos related to recursion in c programming playlist)

[@yashsinghal9748]

Sir please upload all the videos fastly I am very curious to learn from your videos

[@ahmettunaergul9598]

logic is understandable but writing code is ....

[@mr_blaze62]

Thank you so much sir.❤️

[@7s9n]

Amazing 💛

[@gamerzbuddies6226]

congrats for 2m subs

[@mohdarsalan794]

Please upload daily one video sir.

[@nesoacademy]

We wish to achieve this kind of upload frequency.

[@sambitmishra129]

@@nesoacademy sir please 🙏 try to increase the upload speed that is 1 video per day...

[@sowmyar7402]

Thanks a ton sir!

[@palashchandradas2622]

Thank you so much.

[@tulsigupta117]

Thank you sir

[@omkarkanase1349]

Thank you

[@kevinthomas1618]

can we use a single pointer instead of two pointers?

[@sudeepmulumudi]

helpful videos ,,,,,do moree

[@kashidislam8229]

sir please complete the datastructure course as early as possible

[@Nitro-kx7ok]

Thanku sir🔥😍🙏

[@anniamatthews6803]

amazing

[@Moukraan]

thank oyu

[@raghavachekuri7270]

Try to put full course on compiler design also

[@pritampatil4163]

How do u know that u have to delete that 2nd node only how will linked list find that 2nd node

[@MortalKombatTS]

I didn't understand why we use the double pointer in this fuction, why doesn't it work if we use head like in the other functions?

[@bbcbigblackuknowifuknow1148]

we can also do like this bro while (pos-1>1){ ptr=ptr->link; } ptr->link=ptr->link->link; free(ptr->link); I think it is best to not move your head pointer unless it is the only option left

[@DaiMoscv]

Some implementations pass a pointer to pointer parameter to allow changing the head pointer directly instead of returning the new one.

[@user-be4ot5du6s]

Hello can someone please explain why are we passing address of head in del_pos function

[@rahulsharmaaa]

Sir please upload more videos ASAP. pls......

[@rishabkrishnakumar7446]

can we also use single pointer.

[@shubhammane9563]

sir how position variable gives us position of that particular node

[@reverbism]

thank you 9/04/2022 at 6:40 am

[@anshgupta6754]

alternate solution: void delete_node_at_position (struct node* head, int position) { struct node* ptr = head; for(int i=1; ilink; } ptr->link=ptr->link->link; free(ptr->link); ptr=NULL; cout

[@XyYz-yc1wh]

this wont work you first link the node coming after the node deleted then free that node

[@shail0124]

Your del_pos() function could cause segmentation fault if position will be larger than size of List

[@loganhawkins6486]

Can you make the code in python? I am trying to implement in a program. Thanks

[@015_rounakraj9]

Sir how many lectures it will take more to end single link list. Sir reply please

[@SurjeetSingh01]

why have you stopped updating this series ? we are waiting for your next video , so please continue the course....

[@nihalr385]

It's in their app. You need to pay!

[@nithinv2969]

why can't we use head as one of the parameter instead of double pointer?

[@DaiMoscv]

because we're not returning the head, if we want to change the head we must use double pointer.

[@amankumarsingh488]

But we can also achieve this by using only one pointer instead of current and previous !

[@prathyushamiduthur1146]

then we cannot use that free line right?

[@radhikataneja5805]

But with one pointer you only dalete the node for you can't update the previous node link part so for updating the previous node link part you take two pointers

[@amankumarsingh488]

First update and then delete.

[@adamantiumcookieplayzz4050]

yes you can use one pointer to update like all you need is the [[[[[[current pointer to point to the previous node;so instead of position!=1 put position!=2]]]]]] ie, while(position!=2){ //position!=2 instead of position!=1 to point to previous node. current=current->link; position--; } current->link=current->link->link; but the problem with this is that you have to free up space which is being wasted. so rather do, while(position!=2){ current=current->link; position--; } temp=current->link; current->link=current->link->link; free(temp); temp=NULL; this is recommended as the memory occupied by the rogue node is freed up using the temp pointer. of course so you still need two pointers(temp and current) but inside the while loop you just need one, ie , the current pointer and it should positioned at the node at the previous position to the position where the node is to be deleted.

[@Vineeth_Shankar]

What happens when there is one node in the linked list?

[@revan2580]

node *ptr=head; for(int i=0;ilink; ptr->link=ptr->link->link; Can I do this too?

[@rishabhverma5848]

how will u free the memory and make changes i =1 and i

[@30_vineet17]

but sir in this video you showed two programs which program we have to refer to delete a node in singly linked list.

[@harshalkumar4538]

in this video he showed us how to delete a node at a particular position, whereas in previous videos he showed how to delete a node a end or beginning.

[@animesan3687]

What if position is 5 or somthg greter than 3.

[@chinedudaniels2879]

hello, what if we passed just *head instead of **head....would it still affect this function?

[@DaiMoscv]

yes it would, since we're not returning the head pointer, the head from the caller would always point to the same node. Note that the returning type is void, so the caller shouldn't update head every time when calling this function. However, by using pointer to pointer, we're actually moving the head pointer itself by reference. It's a same concept with changing variable by reference, instead of passing it as local variable.

[@user-fx9bp9uu7s]

int deleteAtCertain(struct node *head,int pos) { struct node *ptr; struct node *temp; ptr=head; int i; for(i=1;ilink; } temp=head; for(i=1;ilink; } temp->link=ptr->link; free(ptr); ptr=NULL; } Is this code good for delete at certain position or not without using double pointer?tell me please

[@Linkario86]

Does the Garbage Collector delete the unlinked Node in C#?

[@soumyadipadak]

Sir,Please upload doubly linked list , stack , queue,tree ,serching, sorting asap, this will help us to prepare for placement this year

[@RORAVIKUMART]

it is better to send program link to download

[@mba2ceo]

How RECLAIM HEAP MEMORY ?

[@ritabhsharma6627]

Why do we have to use double pointer here....?? Is it possible to do this without using the double pointer...??

[@rajeshprajapati6662]

Without using the double pointer ? then i think you need to return head to update it in the main function.

[@bhargavsolanki6386]

Still confusion😫

[@accessdenied9393]

We can also do the same task without double pointers: node *delete_at_pos(node *head, unsigned pos) { node *prev = head; node *curr = head; if( !head || pos < 0 || pos < count_nodes() ) { puts("something went wrong"); exit(1); } if (pos == 1) { head = curr->ptr; free(curr); curr = prev = NULL; return head; } while (pos != 1) { prev = curr; curr = curr->ptr; pos--; } prev->ptr = curr->ptr; free(curr); curr = prev = NULL; return head; }

[@lavagaming8449]

me whos using this to do it to asm :L

[@rasoolknggnt5038]

Why is this so much confusing..😭😭 any one give me some tips

[@TECH-ch5dm]

hey guys i have followed along the whole series, here is the complete code // Online C compiler to run C program online #include #include struct node { int data; struct node *link; }; int print_datan_count(struct node *head){ int count=0; if(head==NULL) printf("Link list is Empty"); struct node *ptr=head; while(ptr!=NULL){ count++; printf("%d ",ptr->data); ptr=ptr->link; } printf(" count=%d",count); } int add_at_end(struct node *head,int data){ struct node *ptr; ptr=head; struct node *temp=malloc(sizeof(struct node)); temp->data=data; temp->link=NULL; while(ptr->link!=NULL){ ptr=ptr->link; } ptr->link=temp; } struct node* add_at_beg(struct node *head,int data){ struct node *ptr=malloc(sizeof(struct node)); ptr->data=data; ptr->link=head; head=ptr; return head; } void insert_pos(struct node *head,int data,int pos){ struct node *ptr=head; struct node *temp=malloc(sizeof(struct node)); temp->data=data; temp->link=NULL; if(pos==1){ printf("Use add_at_beg function"); exit(0); } else{ pos--; for(int i=1;ilink; } temp->link=ptr->link; ptr->link=temp; } } struct node *del_first(struct node *head){ if(head==NULL){ printf("Linked List is Empty"); } else{ struct node *temp=head; head=head->link; free(temp); temp=NULL; } return head; } void *del_last(struct node *head){ if(head==NULL){ printf("Link List is Empty"); } else if(head->link==NULL){ free(head); head=NULL; } else{ struct node* temp=head; struct node* ptr=head; while(temp->link->link != NULL){ temp=temp->link; } free(temp->link); temp->link=NULL; } // return head; } struct node *del_pos(struct node *head,int pos){ struct node *ptr=head; struct node *temp=head; if(head==NULL){ printf("Linked List is Empty"); } else if(pos==1){ head=ptr->link; free(ptr); ptr=NULL; } else{ while(pos!=1){ temp=ptr; ptr=ptr->link; pos--; } temp->link=ptr->link; free(ptr); ptr=NULL; } } int main(){ // Write C code here struct node *head=malloc(sizeof(struct node)); head->data=70; head->link=NULL; struct node *current=malloc(sizeof(struct node)); current->data=60; current->link=NULL; head->link=current; current=malloc(sizeof(struct node)); current->data=40; current->link=NULL; head->link->link=current; //count_nodes(head); add_at_end(head, 64); head=add_at_beg(head,45); insert_pos(head, 444, 6); head=del_first(head); del_last(head); del_pos(head,4); //printf(" "); print_datan_count(head); return 0; }