Insertion in Doubly Linked List(beginning, end, specific position) | Data Structures

[@alishakanwar5929]

great explanation

[@sahilmodi3066]

Most smooth explanation

[@ramanpatel2798]

Awesome sir awesome videos

[@pushpanjalijha2779]

Nice explanation

[@Ashmitkaur-xi7gn]

Sir in case of insertion in between or at specific position... How come we know ki jis element k baad humko insert krna hai..woh element list mein present h ki nhi? So we can't directly write t->data!=4 uske liye first we need to search the element to check ??? Isn't it? Plz reply sir plz

[@sp8602]

same ques

[@iforgotmyusername]

@@sp8602 yes you have to traverse the list until you find the position where you wanna insert. agar aap NULL par reach kr jaate ho without finding the desired position then simply return null.

[@nayeemhasan-g9p]

The simplest way to explain

[@VirendraKhanka]

Sir hum sae program direct main mae likhe tho galat tho nhi hoga na

[@vickybabu6300]

Mind blowing

[@satyam_sharan_]

Mujhe kya DSA ka pura playlist mil sakta h aapka sir????

[@vikashuriawal4021]

Already h bhai complete playlist

[@study_bros]

tq bro,best video❤

[@rahulkumaruhr]

Sir jab ham specific position par node ko insert karate hain to aap data value ko locate karakar kiye but if linked list me same data ho to kon se node ke new node insert hoga please reply sir

[@65-tarun84]

SIMPLY WRITE T-NEXT!=VALUE VALUE WHICH YOU WANTO INSERT AFTER OR BEFORE

[@anuj_here]

Better then others❤

[@itishree5669]

Tq sir🙏

[@shaleemyuabbhatti84]

7:29 , after inserting the node at the end of the linked list , if you traverse the linked list from head it will not create problem but if you reverse the linked list by traversing from last node to head , it will not traverse from the inserted node but the last node of linked list before insertion plzzz help me

[@THEGATEHUB]

Please contact me at Instagram if possible..link is in the about section of channel..

[@haleemasadia2586]

I want this lecture but in c++ language 😢