Delete The Last Node in Linked List | Delete At the End | Python Program

In this Python Programming video tutorial you will learn about how to implement Linked List data structure in python in detail.

Data structure is a way of storing and organising the data so that it can be accessed effectively.
Linked List is a linear data structure made up of chain of nodes in which each node contains a data field and link or reference.

To implement Singly Linked List we are using class concepts here.

#DataStructures #PythonPrograms #LinkedList

For more free tutorials on computer programming

[VandourMorph]

why doesn't this video have a million views. deserves more recognition!

[divyaharshitha]

This is the first place where i understood the whole linkedlist concept.. Great work👏👏👏👏

[rohankhatua]

Most underrated channel. The explanation is very much understandable. This become my favourite python programming channel for data structure. Keep on..❤️

[cricwala]

Best channel to understand linked list

[Queruwk]

I love your tutorials, i'm following it every now and then. i'm subscribed. thank God your there, God bless.

[Unknownn]

Actually this is wow I hope you came again to You Tube and expalin other algorithms like hash map...

[prathamdeoda]

I really understood every bit of it thanks a lot

[sumitjha]

thanks alot ma'am for explaining this concept in such an easy manner.

[mohammedattar]

What a great explanation thank you so much

[cricwala]

Great work mam, array, string, linked list per questions kara digey for example implementation of queue stack using linked list

[rushithap]

Mam your lectures are really appreciable. Once after completing lectures on Linked list please do upload videos on lectures of Trees and Graphs

[deepaktv]

Where is deletion at the middle video? and you video always good, keep going

[as]

as per my understanding, the purpose of n.ref.ref is to know if we are on the 2nd last node. So, when that condition is satisfied then instead of n = n.ref I guess "break" shud come and then tmp = tmp.nxt and tmp.nxt = None.

[TheJoker-xwpd]

Mam Your all tutorials are very good but I have a question that I am facing So where I can ask my that problem

[arunaagt]

1:13 why don't i go to the last and make that None?
Why I need to got the last before?

def del_last(self):
lastnode=self.head
while lastnode.next is not None:
lastnode=lastnode.next
lastnode=None
why this is not working? pls tell mam

[joeljohn]

delete_end(self) is missing one condition where Linked List has only 1 element. It can be overcome by adding a conditional statement.

[harishrajwani]

please upload full playlist of DsA with python or else bring a full structured course, I'm ready to purchase

[sourabhbarua]

When we delete an element from linked list, we remove the reference of the node from its previous node. If we don't clear the memory, won't the memory be occupied by the deleted node?

[anuragtiwari]

Mam, when will teach other data structures like hash, trees.

[riyazbagban]

maam here i am getting attribute error for insert_empty(10)
i have not created any insert_empty method
what to do
if you give code file that will be very much appreciated
thank you