DOUBLE LINKED LIST (DELETION FROM BEGINNING,ENDING AND SPECIFIED POSITION) - DATA STRUCTURES

[@sagarikahiremath2690]

You are such a simple man and hard worker lots of respect sir!!!

[@aldrinbenny7512]

SIR,YOUR VIDEOS ARE VERY HELPFUL FOR ME AND MY CLASSMATES, YOU ARE TEACHING EXACTLY AS TAUGHT BY OUR SIR, LIKE PSEUDO CODE FOR WRITING ALGORITHMS.

[@M丹]

Great class sir Im from kerala I had a assignment to submited so i just searching for the ans i have viewed several videos but your video is just a blast nothing to say sir awesome class sir hats off

[@darkking3350]

Sir,at 17:22 instead of writing temp->next=temp->next->next.why don't we write temp->next=tail

[@rahini7675]

Superb explaination

[@SamundeeswariM_]

Super and easily understood the concept

[@rishavsingh1849]

Amazing

[@bhaktidukare7147]

Best explained 😊

[@omswarooproyal]

In deletion part i think we have to make node 2 next & prev fields as null. If not the node 2 is still pointing to previous and next nodes. Since it is not free to delete

[@just_believer]

Null dalo ya free kr lo dono main se null dalke vo node khtm hi smjho kuch bhi kr skte h? I think

[@gabrielflavianus6189]

wow the explanations are really easy to understand , he's sweating really hard btw

[@pradeepkumarsingh6964]

sir u r the best

[@vikaspancharia4920]

While disconnect the node-3, you said that we have to update node-2 next reference and node-4 prev reference only. but still node-3 pointing to node-2 and node-3 via next and prev reference of node-3. so it will not eligible for garbage collection it will still remain in the memory because it is pointing to node-2 and node-3. so could you please elaborate more in that.

[@Haritha__sree__11]

Yes

[@baluvamsikrishna6197]

For that bro temp->next=temp->next->next; temp->next->next=null; temp->next->prev=null; tail->prev=temp; (I know I have been posted this after a long time U posted question but. I hope it will be useful to next who are watching and referring this chat box for doubts

[@karrisrisatyavenkatakishor4770]

@@baluvamsikrishna6197 perfect

[@Faith-is3bl]

​@@baluvamsikrishna6197thanks bro!

[@holyshit922]

7:46 You assumed that list is not empty but after instruction head = head->next head may be NULL and in instruction head->prev = NULL you dereferenced NULL ponter which caused segfault It is tempting to have if(head==tail) { } as edge case but we should be careful on free behaviour

[@mohdzameer5706]

can u write whole double linked list program

[@maheerawaqas3683]

Sir I have a question ..... sir u plz complie these pogram .... I can understand ur lecture but .... if u compile these pogram I will be thankful

[@Touay]

Sir ur videos are helpfull !

[@m.sibtenshekh4797]

Very Very Thank you sir

[@kiran5851]

Excellent sir

[@anuran6180]

Best explanation Sir - your lectures helped me a lot thank you so much 😁

[@abdiaziizcaana748]

Thank You Sir I have a question about deleting part for example I have created 3 nodes in run time if I need one node deleted and I added another one but if I deleted all node in the execution time. the program stopped and not allowed to inserting in run time because there is no node to connected and you need to run time and start in another time so how can we solve that problem I need to delete all node in run time and insert in execution time thank you sir

[@PriyaM-bg1uh]

Thankyou sir

[@NageshPanchal-do8wt]

Thank you very much sir

[@abhisheknath5264]

Thanks sir

[@Gandhiboy]

Thank you so much ❤️

[@SanjuSharma-cd3jq]

U just break the connection after deleting from specific position.... Also tell how to free it

[@saitejaswi8321]

Thank u so much sir

[@San-pt1mx]

Tq so much sir

[@monishkumar496]

we can give tail -> prev = temp for that instead of temp ->next -> prev = temp no sir for the deleting at specific position

[@avanishtatikonda1676]

Ya

[@Allinone-ql5dj]

Ok 👌🆗️

[@Anonymous-gj4km]

👌👌👌👌👍👍

[@ayanghorai3162]

Sir please make a video on complete code for link lists with functions.

[@wahajmohammed1956]

I guess the simplest way of deleting Node from beginning should be var nextNode = this.head.next // storing next Nodefrom head nextNode.prev = null; // Make the nextNode prev pointer to null this.head = nextNode; // change head to next node

[@AkshitPanday]

Please make video on Linked List implementation using Arrays Plz plz

[@arfairam4020]

👍👍👍👍👍👍 Tsm

[@srichanukya660]

instead of using temp of prev =null why cant we use temp of next=null. this will disconnect the link !!!!!!

[@arastusharma439]

In the deletion from specified position can't we write tail->prev=temp instead of temp->next->prev=temp !?

[@amruthdr8364]

consider if it is having 5 nodes, and you want to delete the third element........ tail->prev won't work..... if the nodes are more than 4 nodes....

[@vivekkv5290]

Do while loop is not working sir

[@basant8480]

Exam me Algorithm yata he sir not implementation so please write Algorithm

[@varshithaddepalli7018]

SIR IMPLEMENTATIONS