Inserting/Adding Elements Before The Given Node in The Linked List | Python Program

[@gajanantayde]

This is a very high quality playlist to learn Data structures in python!!!!!!!!!! superb👏👏👏

[@bakhitmahamat7359]

I don’t know how much to thank you Ma’am. I was struggling before to understand DSA but r now with your well detailed explanation, I’m catching up. You’re the best! 😂😂 You’ve got also a fantastic voice😂😂.

[@AmulsAcademy]

Glad to hear that :)

[@jaheerkalanthar816]

Your voice so cute Sister,It is like some Melody, Im a beginner of Python i trying to understand Data Structure,Most of other Tutorials They teach for advanced students,You only teach the Data Structure for Begginner we Love You Teaching Sister Keep Going

[@AmulsAcademy]

Thank you so much :)

[@saradaprasad9594]

I like the way you teach even I'm able to understand these concepts, initially i thought it would be difficult for me but now i'm able to understand DS thank you

[@hustlersadda1]

Thank you🥺❤ I can't find better explanation then this. Keep educating us.

[@prateektiwari4116]

U r osmm🙏🙏🙏🙏💘 really i tried to understand from many channels but stills didn't understand anything but u made it simple for me..... 💗💗💗

[@AmulsAcademy]

Thank you so much 😀

[@rahulsolanki5535]

Wonder woman of DSA love your voice and explanation.

[@anuragchandra7850]

It is impossible to explain better than this❤️❤️❤️

[@AmulsAcademy]

Thank you 😊❤️

[@keerthanaselvanathan4510]

you are really great mam and your voice too...... The way you are explaining is great, clear..!!!!! I feel very happy after watching your video. Thank you so much mam. Do continue!!.Its my hearty request.

[@AmulsAcademy]

Thank you 😊❤️

[@dewangpatil4990]

Thank you sooooo much, ma'am. If you wasn't there my ds was not going to get started

[@AmulsAcademy]

Pleasure 😊❤️

[@snehaa5682]

Mam.. 🤩 really u explained well, u teach from basic, keep it up mam

[@AmulsAcademy]

Thanks a lot 😊

[@cineclassicshub]

while True: print("❤❤❤❤❤East or West Amulya ma'am is the best!❤❤❤❤❤")

[@snex-techprogrammer5110]

Top notch level of explanation....Thanks for this great content for free

[@vishaljagale6342]

Great Conceptual Learning in an easy Manner. Thankyou so much Mam.

[@vamsinadh100]

def insert_before(self,data,x): n = self.head while n.next.data!=x: n = n.next if n.next==None: print(x,"is not in the list") return self.insert_after(data,n.data) This code works for inserting data before an element.simple!

[@TinytotsWorld16]

Y return is given ?

[@keshav9759]

Thankyou mam You cleared me the concepts which no'one could.

[@TarunKumar-hv6jk]

Where can i practice DS problems from basic

[@abhishekchakraborty15]

You are the best !

[@shuaibsaqib5085]

very awesome explanation......Thank You

[@svsc729]

Excellent tutorial mam. Small suggestion: Would it be possible to maintain a Git repo for all your code and paste the link to it here.

[@revanth_richards]

can you cover the advanced topics..??

[@pini5076]

Thank you so much!

[@ghemanthkumar8183]

Thank you mam 😊 Ur teaching is best than our lectures, as I'm a beginner, I'm trying to improve my logics but I don't know what to do ? Can u give any suggestions from ur side mam?

[@AmulsAcademy]

Thank you :) Practice programs try to write your own version of program for a problem :)

[@sm-df6ft]

Explaination is too good I really understand the concept but ,i have a question do we need to create node class and linkedlist class for head on every time for evy operation of linked list like reverse or find middle element

[@AmulsAcademy]

No while adding new nodes you need to create new node for that you need to use Node class :)

[@sm-df6ft]

@@AmulsAcademy thanks maam

[@Kavya-d8l]

Can you clarify me the difference between 'while n is None' and 'while n.ref is None' . How these two conditions works in different way!

[@prachi7414]

I have a doubt that why u used return in second if block in add_before method???

[@AmulsAcademy]

If the condition of if block is true , after executing its body I want to stop the execution of the function 😊

[@prachi7414]

@@AmulsAcademy thankyou!!!! Much

[@sktanweerrahaman9896]

Can't we call directly the add_begin fn inside the add_before instead of copying the code from it?

[@AmulsAcademy]

Yes you can 😊

[@sktanweerrahaman9896]

Ok mam..thanks..your teaching is awesome

[@AmulsAcademy]

❤️

[@bablumishra9789]

Hi amulya, Thanks for the wonderful session on adding element before a NODE. But as I am executing the code provided by you its showing an Error as " Linked list object has no attribute head".

[@AmulsAcademy]

In the Linked List class you need initialise head ... Watch the video completely :)

[@chilakaprasanthkumar1770]

@@AmulsAcademy 🤣😂

[@Unknownthewiu]

Anyone explain? Why I can't use while n is not None , but n.ref? Can't I just use while n is not None and if n is None?

[@DACS_NARESHKUMARP]

At the condition first node ==x Why didn't you used n instead u used self. Head Iam not getting answer for using n

[@AmulsAcademy]

I am referring first node and we can access first node data using self.head.data also. if you want you can use n also. :)

[@makeyoulaugh5616]

Please recommend me a book for dsa using python

[@AliKhan-rr6kz]

while n.ref is not None: if n.ref.data ==x: new_node.ref = n.ref n.ref=new_node break n=n.ref why we need to add break in the loop here,if i remove break while loop is running continuously .i dont get it, loop should end after the last node right? where last node ref is none then loops terminates.can anyone help plz.

[@chaitanyakrishna9398]

At time stamp 6:03 Cant, we call the add_begin function in add_after function when x is the head data instead of copying the code again. I tried this but showed an error so please explain how to call a method in another method of the same class in python.

[@AmulsAcademy]

Try self.method name :)

[@Biswajit_Pradhan]

mam don't know why but code is showing run time error def add_before(self,data,x): if self.head is None: print(" Linked List is empty") return if self.head.data==x: new_node=Node(data) new_node.ref=self.head self.head=new_node print(" Node inserted successfully ") return n=self.head while n.ref is not None: if n.ref.data==x: break n=n.ref if n.ref is None: print("Node is not present in the Linked List") else: new_node=Node(data) new_node.ref=n.ref n.ref=new_node print(" Node inserted successfully ") return this is my code..and while I am trying to insert a node at the starting position it is showing that "Node is not present in the Linked List" . Please help me on this

[@iNeFFaBLeSaPiEN]

600th like

[@amarnathr2348]

Please provide notes mam WE CAN REFER

[@AmulsAcademy]

I will try :)

[@selvanm2872]

👍

[@AmulsAcademy]

Thank you :)

[@saikrishnacherala2519]

if any one has wrote this data structrures notes or anybody has all the notes written.. if Yes please send me

[@tharuntharak2548]

It's not inserting the element before the given node(x). It is inserting only if the x value equals to the first node. Please help me Ma'am. I have written the same code as you.🥲

[@hustlersadda1]

You pasted the another else: Just watch the video and write as ma'am has written. I'm telling you because this happens with me also. Don't worry just write as ma'am did 😊