Data Structures in Python: Doubly Linked Lists -- Reverse

Amazing, your videos help me a lot in my computer engineering journey.

probably the only coder teaching DS in python as Effective way

Thank you, it is really nice to watch such explanations, but I have a question regarding this one, why not have a tail in a doubly-linked list? and what are the use cases for doubly-linked lists when to use them

thanks. i tried the problem on hackerrank without learning about it first but your video explains it very well

Good... explanation... loving your videos ❤️❤️

It's really great...Amazing work...

sir, u are amazing. keep making more videos. It helps me a lot. thanks, u so much.

Awesome video. I just had a quick question though. When you made temp=curr.prev dosnt that make temp None since curr.prev is pointing to None? Thanks for your help and awesome vids!

this is so complicated compare to traversing forward. Couldn't we have the print statement somewhere in the traverse method

getting this error:
print(cur.data)
AttributeError: type object 'Node' has no attribute 'data'

when cur initially starts off at cur = self.head, isn't cur.prev supposed to point to None as opposed to B like you mentioned in the video?

I am a little bit confused with the:if temp:    self.head = temp.prevI understand why we need the if statement but it is the vale of the temp.prev that is confusing me a bit. In the example, when starting with A, when it runs the if statement for the first time what would the pointer/node of temp.prev be?