Reverse a Doubly Linked List in C

Write a program to reverse a doubly linked list.

[@racheljiminseo]

Thank you so much for this perfect explanation..I was struggling understanding reverse doubly linked list until I watched ur video. Thank you again

[@dhrupalprajapati317]

Nice sir , completely understood the topic and you are that much down to earth that everyone will like the way of explaining the topics.

[@hopesalive2004]

I was literally struggling with this q for the last 2 hours, thank you from the bottom of my heart sir 😊

[@abdulhadialamri4859]

Thanks so much. I just understand reversed Doubley linked list. I was trying to find an easy way to grasp this and I liked what you did here. :)

[@vanbap]

I have struggled with this problem for 2 hours. Tks sir its really helpful.

[@TheAllen501]

The 1st time I understand Indian accent. You explained well. Thumbs-up!

[@shreyashikha3506]

U explained in a very easy way... Before I m so much f confusion in linked list but after watching ua video it helps me alot.. Thanku sir for uploading.. Can u plzz upload a video on circular singly linked list.

[@sagarbora7768]

Perfect explanation with iterations on every node !Found this svideo insightfull Sr!!!

[@misatran1107]

finally, I can image the reverse process : ))) Thank u Mr Vive

[@mohmmadsadi7268]

That's a great effort from you Vivedanand. But I think you forget the final step which is : To let Head pointer -> pointing to the temp (node 'e') ... Head = temp;

[@sherifali484]

Finally i understood it thank you so much , your explanation is really good

[@NatureLover-oq6uc]

Very Good Explanation...Loved it

[@vidpulse4267]

your explained is very powerful I hope make more useful video

[@krishanudutta2943]

You explained it very beautifully thanks a lot

[@sravanthimarpu562]

Thank you sir ....need an explanation for quicksort on singly and doubly linked list

[@franciscoencarnacao2156]

Perfect Explanation!! Thank you sir

[@vaishnaviv7113]

Finally i understood the topic thank you sir

[@deepanshduggal9742]

Take a bow sir! Wonderful explaination

[@sheldon9415]

Thank you so much for this wonderful video.I totally understand.Very clear and nice explanation!

[@7AMzUS2003]

thnx a lot mr vivekanand for your explanation

[@birajdaimary2429]

Sir make a video on circular linked list...and queue too...it will be help us a lot

[@stockmarketinvestingforeve6263]

At the bottom, temp = temp -> prev; shouldn't that be instead head = temp -> prev ; ? Great Video/Explanation, by the way.

[@abhinavv5850]

right

[@alexlivadaru286]

Thanks a lot! I really needed this!

[@Kgp-ty5dk]

brilliant explanation sir!

[@amr19932012]

When was the step that head became tail and tail became head ?

[@lsgtalk1996]

superb explanation

[@CodeNinjaByte]

//meathod 1 using temp lag of curr by distance 2 // note that in the last element curr is pointint to NULL temp is pointing // to second last of list soo move to next of it if(head==NULL || head->next==NULL) { return head; } Node *curr=head; Node *temp=NULL; while(curr!=NULL) { temp=curr->prev; curr->prev=curr->next; curr->next=temp; curr=curr->prev;// or curr=temp; } return temp->prev; //meathod 2 using temp ahead of curr // note that in this temp is ahead of curr soo in last case //curr is NUll and temp is at null and we can iterate further //more so terminating condition needed otherwire curr->next is NULL->next(segmentation fault) if(head==NULL || head->next==NULL) { return head; } Node *curr=head; while(curr!=NULL) { Node *temp=curr->next; curr->next=curr->prev; curr->prev=temp; if(temp==NULL) { return curr; } curr=curr->prev;// or curr=temp; } return curr;

[@anatulea559]

thank you! great explanation

[@pranavvikharankar7456]

plz sir post videos on how to calculate time complexity of program

[@TheFitFiddler]

Wonderfully explained!

[@tadessezelalem6555]

tadesse

[@RAVIKUMAR-ef4wo]

Bhai love you from hyderabad

[@anum2471]

explain about priority queue

[@DivyaSingh-bl4cj]

09:18 Stamped with love, LINER

[@DivyaSingh-bl4cj]

thanks for the great vedio

[@ritik84629]

life saver.thank you

[@SilentNight_tour]

good job sir

[@ProgrammingLearning-v4c]

that is helpful thanks

[@rohitmarati8544]

big thanks to you sir

[@football3415]

Thank you man

[@YasenAbker]

Thanks a lot

[@AkshayKumar-nm4ci]

Thanks Nyc Explanation

[@aleenayt1870]

Well done

[@lokeshg8938]

Please tell the whole program once .next 2 u tell this concept only

[@edism235]

Thanks so much sir!!

[@danact1135]

you're great!!

[@anandprakash4995]

Java solution : while(head != null){ DoublyLinkedListNode i = head.prev; head.prev = head.next; head.next = i; if (head.prev == null){ return head; } head = head.prev; } return head;

[@Funnyvideos-ih8nx]

plz made a header link list video

[@hirasuleman4946]

Thank u sir☺ Respect from pakistan

[@alroygama6166]

Fo

[@indranilchakraborty5949]

Thank you sir ..

[@srinivasanshanmugam9527]

Thanks its very explainative

[@MiyamotoMusashi23839]

thanks

[@jibranjafry2625]

thank you sir

[@mohamedelhajaji-yr2ee]

legend

[@this.is.sheraf]

Nice

[@sudhanshumishra9302]

Its vry complicated

[@keerthanasubramanya9880]

Thank you

[@FamousEgyptboy]

Thank youuuuuuuuuuuuuu!

[@mayankgindodiya4732]

Its throwing TLE on gfg

[@Ankitakumari_rnec]

nice

[@FrozenByTheSun]

👍🏻

[@Adarsh0543]

based

[@tapanbasak1453]

vai app maal hain

[@imvickykumar999]

something like swapping... !!!

[@adarshchougale1106]

/*This may look easy */ temp=head; while(temp->next!=NULL) { temp=temp->next; } cur=temp; while(cur!=NULL) { printf("%d ",cur->data); cur=cur->prev; }

[@moutusimodak1620]

It's not running. Given input is 10 20 30 40 But output is 40 30 Which is wrong output. How to resolve this error?? Please reply

[@MHN1001]

thank you man

[@anashaat95]

Thanks a lot