Delete Node in a Linked List | EP 3

Hi, I am Fraz.
I am Software Engineer working at Curefit and I love teaching.
This is my Channel where I upload content related to Interviews and my personal experiences.

My contact details

[Rahul-lkhk]

Every episode just learn and learn and learn like a addiction of watching a interesting Netflix series

[ankurgogoi]

Simple and Efficient. Absolutely what I was looking for.

[raghvendrakhatri]

Lect - 4 completed, sir love♥️ the way you explain each and every concept, please keep creating such wonderful content 💯 your playlist are helping me alot in understanding the topics and improving my skills.
Thankyou bhaiya ♥️

[purushottamkumar]

Started Today and i will finish by Today. FOr revision also it is amazing. Short and crisp with explanation

[utkarshsingh]

Sir please add these series in the playlist so it will be very helpful for us

[superboss]

Your explanation is good to the point thanks 😀👍

[farhankhan-uzkk]

thank you sir...every concept is clear...you are doing great work...and ..keep it up...☺♥

[myyoutubeisthis]

Thank you bhaiya for this amazing approach.

[itaaryanagrawal]

sir in python do we need to delete the node or does the virtual machine does it automatically?

[GAMINGHUNT]

Bhot acche episodes hae bhiya, now a days i am busy with my class assignmets but whenever i got time i watch one episode, keep creating content like this i will finish this series in a week soon ...keep creating please...

[rajatkhatri]

even before u explain how to do it i try myself then watching u do the same as i did make me feel like level->next;

[K_EN_VisheshSaini]

why did we do node->next = node->next->next? temp2 was already pointing to the node to be deleted, i.e. node->next. So why didnt we just deleted temp2 after ListNode *temp2 = node->next?

[girdhar]

9:05 I love this man. I love this man.... just daymnnn... so coool

[nonstopcodingcodewithadity]

bhaiya please tell is this approch also right that haam jisko delete karna hai uska address ak pointer may hoga phale jo delete karana hai uske phale ka node deleted ke next node ko point kar lega and we will free(t) c lang

[aasifali]

i have a question if the given node is a last node and in the given code we are just deleting it then how will the previous node know we have reached the end because the connection to the null has been deleted.
if anyone has some good answers plzz reply.

[pulkitgupta]

Hi @Fraz and good people... I have a doubt?
suppose in this case node can also be a tail node, then how we will delete that node in java.
Anyone please help me in this? do we have any approach for this?

[virajjadhao]

you teach better than the coding ninjas 😄😄😄

[syedashrafi]

Bhai.. in edge case(if node is last node), we're simply deleting it.. is it's previous node pointed to null automatically or it'll point to garbage value.please make me understand this point in case of Java and also C, C++.
Thank you bhaiyaa..

[HarshRaj-kpgk]

Please 🙏 continue sir it's humble request sir

[anandyadav_]

Sir, here the class node has only one data member which is "val", that's why we can write swap(node->val, node->next->val). How to copy the values when there are so many data member(like 100). then?? actually assigning the values manually is not feasible.