Delete a node from single linked list( head node/ middle / end node)

[@harismasoom6634]

Thank you very much sir may you stay healthy and keep sharing your knowledge. This explanation helps me a lot.

[@ratankhalsa6034]

What simple and amazing explanation. Thank you so much!

[@sauraV_Verma]

You forgot to mention the case of deleting an empty list where you print an error message. However trivial it may sound but this completes the solution.

[@ayeshajamil5713]

Your method of teaching is sooo welll😍😍😍

[@soumyaa1190]

Vivek, your explanation of the logic is too good. Could you please post the code's in javascript as well.

[@josueteodoromoreira8921]

just convert it to your language mate

[@analyticstamizan677]

sir your videos are very easy to understand the concept..thanku....

[@fahadmakabugo2114]

This is the best explanation I have seen.

[@mayurtakate5138]

sir your really to good.....please make video on programming of Trees & Graphs

[@muhammadkashif19]

Hi Sir The way of your teaching is so good Keep sharing your knowledge in this way we wil always support you...:)

[@patelhuda5542]

Sir ua explanation is really oustanding it makes DS a bit easyy.. it would be very nice if do explain one program with each algorithm...

[@devotion_surya3741]

Wow sir, hats off what an amazing explanation.

[@ConnectBhawna]

thank you sir for sharing your knowledge .It is really helpful for me .

[@vivekanandkhyade]

Thanks Bhavana

[@bitsread7249]

Good, i understood the inserting more. I wish you could write algorithm for this rather than the code. The inserting was perfect. You are good, Thank you.... I've subscribed and i click notification wink

[@tlikhitha5338]

Sir ur explanation is helping me alot.thank u so much sir

[@sandhyanityasri1307]

Sir ur explanation is very gud and simple. Thank u sir.

[@RajPatel-is8em]

Thank you very much sir.love from gujarat🤩😍😘

[@sanjaykumargupta6261]

ur video is awesome sir .its a humble request to u to make all the video related to data structure.

[@prajaym3114]

Please make a video on stack and queue 🙂

[@sangappam217]

explain this program sir delete the node containing even values and we need to make a new linked list of only even node

[@anupbisoyi]

Please explain delete last occurrence of an item from linked list in a separate video.

[@md.jiarulislam2068]

Amazing Explanation, Sir....Thank you sir

[@monisattili7642]

Thank you man , your videos very helpful for me , keep going

[@vivekanandkhyade]

Thanks Monis..!

[@sushant3530]

​@@vivekanandkhyade Sir plz give Github link of program of this video it would be highly appreciable and thankful . or sir make a running program video. plz

[@vishnuvardhan-md1ux]

hello vivek thankyou for your videos please do a video on infix to postfix conversion

[@vivekanandkhyade]

yes sure vishnu....

[@sushant3530]

@@vivekanandkhyade Sir plz give Github link of program of this video it would be highly appreciable and thankful . or sir make a running program video. plz

[@revatineigapula4747]

sir its really nice but can u give me some example in single linked list by taking numbers.

[@ameenabeehanasi5969]

Can understand easily now!. Thanks so much

[@vivekanandkhyade]

Thanks Ameena..!

[@paramkhurana5578]

Hi Sir! Thanks for an awesome video! But, I cannot find the code in the Github repository. Could please put the code in your GitHub repository? Thanks🙏😊

[@nicholas_as]

at 9:28 can we refactoring the code so we don't need if syntax after the code breaks from while loop into this : q =>P next. Because i think this code can be applied when we want to delete node in the middle or in the last. If we want to delete the last node, we know that p next is null since it breaks from while loop. then the pointer q should point to p next... any opinion ???

[@AlgoXperience]

sir really u r really .....,.,.,..,.,}

[@yogalakshmi1206]

Can u make it a single program which consist of all the implementation sir

[@kiranappu3064]

thank u for this video mrs viveknand......... may i this code link plz as soon as possible

[@buskilamaor9587]

what happens when the input is 1000 -> 1000 - > 1000 and k = 1000, aren't you left with the head element not null and its "next" is null??...somehow i tweak the algorithm but in any try some case works but other fail..

[@zelekethomas3028]

thanks,I understand many things from your channel

[@anupgn6206]

Video is good,but 1 kind correction i.e its not delete(p)....its free(p)

[@andreassoteriou5602]

He deleted the node of the value that person entered. not the node that person entered..

[@rumaborah1229]

thank you for this video and plz do a video on stack implimentation using link list

[@vivekanandkhyade]

Thanks Ruma.....will do video on stack using linked list..!

[@sushant3530]

@@vivekanandkhyade Sir plz give Github link of program of this video it would be highly appreciable and thankful . or sir make a running program video. plz

[@LahoreFilms]

hi vivek! I am Hussain from Lahore Pakistan i have seen lot of your algorithm videos for help and today i went to the link you gave for complete code please dont mind i want you to know that the interface or the theme you used for your blog is not user friendly . as it is difficult to find the correct or required output in small time there is need to manipulate every single link or link you gave at the home-screen. Regards your student from Pakistan.

[@LahoreFilms]

one more thing i have learnt lot from you using KZbin platform.

[@akhil1786]

i want full program with executed

[@katrinejensrud537]

thank you so much!best explanation

[@ayushshrivastava696]

sir you explained well but this program will not run

[@mahamnadeem6244]

i want full based method of writing a link list code in c++ which can be compiles also

[@enigmaticgale7436]

i think, in internal deletion , there should be q=p->next; instead of, q->next=p->next; because we are linking the q to the next of p,not linking next of q to next of p.

[@areejgul8725]

Please add whole program in your description box or give a cpp file

[@ponnuvel659]

I found bug in your code... what will happen if data is not present in linked list..you will get segmentation fault.so make it fix. apart from that great technique to delete the node. Thank you:)

[@MUHAMMADUSMAN-rx9df]

use if then else if then else not found

[@jayalakshmiappurubuktha3096]

Thanks sir it was very useful to me

[@lakshmidvs3258]

very nice explanation sir

[@BRIANZ-h2t]

REAL NICE EXPLAINATION

[@thesoftwareengineer17]

hey i guess it will be while(p.data!=d && p!=null) . And there will be a condition to checkif(p==null) and if so it mean data does nto exist in the list

[@tharunyajayaseelan9674]

I understand your explanation. Thankyou

[@farheenazeem9511]

nice explanation! Thank u so much..

[@GlobalHuntersTech]

sir yu are amazing................

[@s.a.musharaf8291]

Nice explanation!

[@shubhenduinfotech5992]

Thanks this videos helped me😀😀😀

[@supriyapurohit1090]

Thank you soo much sir!!!

[@logic_master950]

Thanks a lot , you are the best indeed

[@mukeshmkssolanki]

Sir single linked list me short ka video bnaana plz

[@ThuongPham-wg4bc]

absolutely clear. thank sir

[@balain5391]

Why we are maintaining two pointers p and q, instead we can do directly ptr.next = ptr.next.next

[@AKHILDS-j3v]

you are amazing thans sir

[@akshaymomle8231]

Sir u r great....... Thank uuuu

[@falala9570]

You are amazing!

[@sagarjauhari6491]

Thank u for this class, sir !

[@revathybaskar9940]

Sir can you give algorithm for this

[@picklughosh9994]

sir linked list ka ek playlist kar do na toh acha heta hein

[@andreassoteriou5602]

My problem is that you delete the node of the value that the persnon entered. What about deleting the node that the person entered. for ex: i say delete the 3rd node... and not the '15' which is the value of 3rd node..

[@mradulbohra2897]

i guess in that scenario we will run the loop having a variable 'k' having an initialising value of '1' and we will take the value of node from the user in a variable called "position" and in every iteration we will be doing k++ and after every increment we will check if(k==position) and then proceed in the same way

[@priyammukherjee9725]

what does this d denote?

[@Abhiraj91197]

if desired node value not found then this algo will delete last node anyway its absurd ..

[@subhankardey3813]

Sir make video on stack or queue

[@vaishavielayaraja9078]

Pls post trees and graphs sir

[@FactQuest-siuu]

requested please to have a bit larger board and speak fluently beside this awesome job

[@kaustubhpatil651]

yeah just speak fluently sirji. It will have a good impression on viewers

[@evelynkabiite8407]

Amaizing!!!

[@fatimayousaf2156]

make a video to generate singly linked list and disply it on screen

[@xDxDFabian]

nice dude! keep it up!

[@tianhao7783]

nice explaination~~~

[@amiratnapuri7678]

Thanks bro

[@khimratibrahim3309]

Head node tu nhe huta but head pointer huta...but now you say that Head node

[@prakhartiwari1953]

Can i use this code in exam as algorithms ??

[@codingguru4865]

Check this Tutorial on Data Structures kzbin.info/aero/PLbRk-vKGcVtbyctZWP9SUYewwUfx75CpZ

[@PraveenKumar-ft2kr]

Thank you sir 😊

[@sachinbhardwaj2679]

Quite helpful

[@vick2920]

Sir please add delete a node and insert a node in github

[@chriscozilas]

i love you🔥

[@josueteodoromoreira8921]

oloko kkk

[@neerajrai9197]

osm sir

[@vivekanandkhyade]

Thanks Neeraj

[@sushant3530]

@@vivekanandkhyade Sir plz give Github link of program of this video it would be highly appreciable and thankful .

[@shantanutiwari3287]

Why such complicated code? Can u Plz write only the code thart u hav done in the inserting algorithm

[@sdsouza1753]

lol

[@adithilife6962]

nice

[@Vineetkumar-qz4wj]

Thanks sir

[@mishamohan9298]

thnk u sir

[@anjalir8504]

thanks sir

[@maleselalehlogonolo7747]

STACK INSERT AND DELETE

[@unnamedsoldier1]

Thank you

[@partz6990]

Brilliant🖒

[@sayeedkhan4886]

Sir can u give us java demoo

[@OmPrakash-zp3ov]

Unable to delete the First/Head node , can you help me with below JAVA code snippet. Thanks public static void delete(ListNode head, int element) { ListNode q = head; ListNode p = head.next; int d = element; if (q.data == d) { head = p; q.next=null; System.gc(); //Unable to delete the first node Why? } else { System.out.println("Is I ma else"); while (p.data != d) { p = p.next; q = q.next; } if (p.next == null) { q.next = null; } else { q.next = p.next; p.next = null; } } }

[@sidruhela7595]

Bhai yr bhot tdga pdhate ho yr ap Koi unphad bhi smj jae

[@dhruvilpujara1523]

How to move the last node of a linked list to the middle of the list: Do check this out - kzbin.info/www/bejne/qqS1on55prqXf7s