Delete a node from Doubly Linked List(start / middle/ end node)

[@faysalarab]

thank you, you make sense more than many professors.

[@icewizard3664]

Thank you so much for your help. If it weren't for your help, I would have failed answering all of the questions regarding my double linked list.

[@Rickyvidere]

dude you should be my professor you are amazing at explaining

[@antragupta1001]

thanqu so much sir tomorrow is my end sem exam n u make my concept clear about deletion in doubly linked list thanks for helping.....😊😊😊

[@MukeshRajput1982]

www.mukeshrajput102.com/2017/12/write-c-programs-to-implement-double_11.html

[@AlgoXperience]

sir u r my staff in this whole topic

[@Nao-Tomori]

6:47 Can you just declare p as the last node so that it saves time? Maybe add a tail node?

[@NehaKumari-yf9bh]

thanks sir !!! best explanation on deletion of doubly linked list

[@muskansinghal4467]

can you please post about insertion and deletion in circular linked list? its a request please. Your methods are quite understandable and easy to learn.

[@adityasrivastava2814]

Thanks a lot sir!!!Your videos are really helpful!!!

[@anupmasaxena8399]

Hello sir, can u please make video on circular linked list

[@kaushikjain9423]

ek dum mast samjaya sir aapne

[@alekhyaali7273]

thank you ....thank you so much sir......your teaching is awesom.......it was really helpful for me....

[@143_monika5]

Thank you so much. It will help me a lot ❤️

[@shivamnehra5532]

thanks man ! your videos are more understandable

[@kobepwe2513]

It should be While (p== "d node") because u still haven't delete anything and if u are, while(p!=delete position) should stop at "c node". But still great lecture. Will watch other vids too.

[@priyammukherjee9725]

why did we use delete p and not free?

[@kobepwe2513]

@@priyammukherjee9725 its okay whatever you want to use. Its just a variable name. It will still work

[@williamjava]

You should teach the course in my University! Excellent professor

[@yaleboost4400]

thanks very much best explanation i get main point rather than my lecture continue to another algorithm topics """""""""""""" KEEP IT"""""""

[@nileshvelip90]

last movement sir u r very help ful to me. thanku soooooo much sir

[@vivekanandkhyade]

Thanks Nilesh..!

[@devotion_surya3741]

Sir, you are great 💥💥

[@grozavklaus1900]

Great job , thanks sir , i hope i will find your videos as helpful as this was

[@user-tm1ix7xi1n]

If you can make a video of time complexity, it would be helpful. Thank You.

[@rabia11basri21]

Yes plz😊

[@muhammadmuhammadsuleiman7673]

We are really getting updated thru your help, pls sir, send me the linked list codes for single, double and circular linked list

[@b345_padmadevmishra4]

please explain Insert/delete node at beginning/rear of circular singly linked list

[@rishitasingh3955]

Thanx for makig my dsa soo easy ...... could u please explain algos on circular doubly linked list

[@Mhmdshoeb]

You Are Doing a Great Work, If u Explain The Time and Space Complexity of Those Algorithms at the end of Your Videos, Then that would be an added advantage, and It will be Appreciated.

[@MukeshRajput1982]

www.mukeshrajput102.com/2017/12/write-c-programs-to-implement-double_11.html

[@georgecurington8156]

out of curiosity , in the delete node procedure, is it really necessary to have two different types of loops ? One for deleting in the middle versus one for deleting at the end. It seems that only one type of loop is required. would this not work for a java implementation: @Override public boolean deleteANode(T data) { Objects.requireNonNull(data); if ( head == null ) { return false; } /** get the head pointer position first out of the way **/ if ( data.equals(head.getData())) { return deleteHeadNode(); } Node ptr = head; while ( ptr != null ){ if ( ptr.getData().equals(data)) { /** * we want to delete this node:D * a -- D -- b * D -- a -- b * a -- c -- D */ Node ptrNext = ptr.getNext(); Node ptrPrior= ptr.getPrevious(); ptrPrior.setNext(ptrNext); if ( ptrNext != null ) { /** it was the last node in the list **/ ptrNext.setPrevious(ptrPrior); } cntr--; return true; } ptr = ptr.getNext(); } return false; }

[@crosshood2137]

we need the circular linked lists too

[@poojarajgowda7967]

Thank you very much sir, it is really helpful for us

[@ahitch3681]

Could you please tell me how to detect these three scenarios in one remove method for an iterator? My first instinct was to check if the previous is null and then that would mean you are at the first, however Java will not let me use that as an option because I am dealing with objects.

[@TakumiSoldier]

Very helpful, thank you very much!

[@rahmahayuningastuti8264]

Thank you very much, sir!

[@shaikahamad7764]

Nice teaching sir

[@williamjava]

Excellent!!! Thanks so much professor!

[@vaibhavgarg7345]

it was good thankyou sir easily samaj me a gya

[@crenshaw0024]

we need to delete the store_next and store_prev pointers along with p correct? I just see you deleting P. Thanks

[@JossinJax]

For deleting a link in the middle, why can't we just use one link and use link.prev to point to the p.prev and link.next to point to p.next instead of using to pointers?

[@anhhaopham7919]

thank you so much teacher !

[@andreimitrasca7815]

Thanks a lot for these explanations!! :)

[@zelekethomas3028]

u are amazing man carry on!

[@kashfulhudha7242]

Thanx... it was really very helpful

[@vivekanandkhyade]

Thanks Kashf..!

[@adrita_chatterji]

How can you compare a pointer type variable p with an integer type variable delete_position???

[@shubhammorankar2740]

sir can you please upload the video on circular linked list insert at start , middle , and end ?

[@yalinichandramohan5260]

ir can you please upload the video on circular linked list insert at start , middle , and end ?

[@antragupta1001]

plz make a vedio on asymptotic notation ....

[@palakmehta0427]

Plzz give a video of circular linked list algorithm.......

[@rajeshkothapalli8415]

Algorithm to delete a node with given item of information in a single linked list

[@gorledivya6451]

Sir in double linked list the last node is not empty ,why u should mention it is null

[@juliakolbe511]

thank you my man

[@amankhare3115]

which language is used in the program you are explaining ???

[@dipalikatkarvlogs3158]

Thanks sir

[@amankhare3115]

which language is he using in the program ?

[@mrityunjaymishra2490]

would u please make a video on xor doubly linked list?

[@vipingautam9852]

No need of creating store pointer can be done this way p->next->prev = p->prev; p->prev->next = p->next; delete(p);

[@holyshit922]

you are right but you should wrap these instructions with if then else

[@stonecoldcold2941]

Thanks a lot sir

[@deyavasdisen5206]

Sir can you please explain data structure using java.

[@varshar6474]

do search prgrm fr doubly link list

[@debebewogderese8712]

any video related with the application of Linked List

[@asifnaveed4800]

thank you very mush sir i visit your website do not meet the doubly linked list code please tell to me.thanks

[@vivekanandkhyade]

I will check it Asif and update the code on the link.

[@mindbodyps]

Thank you sir

[@amruthavani6231]

Sir please update single and double circular linked list

[@michael.1101]

what a legend

[@shahsaudkhan2213]

write an algorithm to delete node from doubly linked list

[@vivekanandkhyade]

will soon upload..!

[@y.srinivas4231]

I am not getting code for double linked listj

[@shalini13vlogs]

Great video

[@ramromex3424]

Thanks DUDE!

[@infiniteunconditionallove1620]

thank you very nice

[@poojadeepthi9381]

c program cheppagalara continuous ga

[@asifrahman3489]

thnx a lot bro

[@ABHAYKUMAR-fr8lm]

Thanx sir g

[@jitenchoudhary6272]

👏 👏

[@danielwakaba9865]

Thanks.

[@vivekanandkhyade]

Thanks Daniel..!

[@muhammadbilalhafeez832]

o bahi white board sa pichay hut ka samjhaya karo

[@kurianbenoy9369]

You are not facing audience, I just see your back 90% of time

[@shreyparekh7278]

Very bad and short trick explanations that might not help you!!

[@JossinJax]

For deleting a link in the middle, why can't we just use one link and use link.prev to point to the p.prev and link.next to point to p.next instead of using to pointers?

[@JossinJax]

For deleting a link in the middle, why can't we just use one link and use link.prev to point to the p.prev and link.next to point to p.next instead of using to pointers?

[@JossinJax]

For deleting a link in the middle, why can't we just use one link and use link.prev to point to the p.prev and link.next to point to p.next instead of using to pointers?