Python Program To Implement Binary Search Tree | Program 6 | Deletion{Except Root Node With 1 child}

[@gajanantayde]

I get fully absorbed in learning because of your teaching and forget to like the video always🤣

[@miroslavdanilov902]

This is by far the best explanation of BST node deletion on KZbin.

[@uriaheric1565]

you prolly dont give a damn but does anyone know of a method to log back into an instagram account? I was stupid forgot my password. I would love any tips you can give me

[@angelokaiden7196]

@Uriah Eric instablaster :)

[@uriaheric1565]

@Angelo Kaiden i really appreciate your reply. I got to the site through google and im in the hacking process atm. I see it takes quite some time so I will get back to you later when my account password hopefully is recovered.

[@uriaheric1565]

@Angelo Kaiden it worked and I finally got access to my account again. I'm so happy! Thanks so much you saved my account!

[@angelokaiden7196]

@Uriah Eric Glad I could help :D

[@shubhamjain1316]

You are greatest Amulya ma’am

[@kancharakuntlavineethreddy9320]

Ma'am If we try to delete an element that is not present, it's automatically deleting some other element(Preorder was not the same as Initial). I tried to debug the code. And it's working when we "return self" in else part. if data < self.key: if self.lchild: self.lchild = self.lchild.delete(data) else: print("given node is not present in the tree") return self elif data > self.key: if self.rchild: self.rchild = self.rchild.delete(data) else: print("given node is not present in the tree") return self Just wanted to share with the community:)

[@LlanzKennethLuy]

You can try this: if data < self.key and not self.lchild or data > self.key and not self.rchild: print('delete_node():', data, 'was not found') return if data < self.key: self.lchild = self.lchild.delete(data) return self if data > self.key: self.rchild = self.rchild.delete(data) return self

[@nayankamthe6734]

please create placment coding series. it will help us very much.

[@ramyakotike85]

Mam, can you please provide a video to count no of leaf nodes in BST?

[@pindropnonsense6746]

Mam can you explain last “return self “ statement like my pre order is 10 ,1,2,12,15,25 if I deleting 15 without add return self statement it give me pre order 10,1,2 but actual is 10,1,2,12,25 so please explain me how it work.

[@smarty420ful]

return self is explained in next video

[@aswath8265]

Really amazing

[@AmulsAcademy]

Thank you 😊

[@shankhadeepghosh6086]

Mam, some confusion in when delete 1 child node .. You wrote self.rchild is none it's means .. In a example in your tree the last rchild is 500 then if we writen temp = self.lchild then how it's store 500 in a temp ?? Please clear my doubt 🙏🏻🙏🏻🙏🏻

[@saranyav5244]

Mam,pllz upload how to install c c++java python on windows 7...and how transfer the data from cd to system and syst to cd ....plzzzz upload

[@iNeFFaBLeSaPiEN]

thanks

[@aasthapant]

what should be the code if we want to replace 50 with 70?, cause i dont think it will be the same

[@wagishasingh_2203]

Ma'am plz upload the remaining videos ASAP

[@AmulsAcademy]

Sure 😊

[@anythingit2399]

@@AmulsAcademy Ma'am, I am done with 72/72 videos, are there any video left? Also, please solve problems from Leet Code Ma'am, it will really help

[@saranyav5244]

Teach about applet program in java mam plz

[@AmulsAcademy]

Will try 😊

[@dineshyadav9457]

thank you ma'm

[@AmulsAcademy]

Pleasure 😊

[@rraviteja2460]

Mam level order is possible or not

[@junior_tee5320]

Is there a video on creating a program with menu's?

[@AmulsAcademy]

No 😊

[@snr-u6h]

Thank u mam😁😁😁

[@AmulsAcademy]

Pleasure 😊

[@selvanm2872]

nice

[@AmulsAcademy]

Thank you 😊

[@saranyav5244]

Plz teach about hardware parts mam

[@AmulsAcademy]

Will try 😊

[@venkateshkoneti2116]

madam, What about the repeated elements?

[@shashidhardevraj]

duplicates are not getting inserted as shown in the previous video series

[@naveenchebolu6757]

Plz upload same for Java programming also from basics

[@omalie745]

Apply the same logic. You don't pay her.

[@shreehari2589]

@@omalie745 nice reply 👌🏻

[@tejasrees2797]

Can u please say level order traversing code

[@venkateshwar9641]

Why we are returning self at the last step?

[@AmulsAcademy]

Check out the next video, in that I explained this method with example 😊

[@zainabbohra2915]

mam what about root node not getting ?

[@zainabbohra2915]

someone please help me

[@AmulsAcademy]

Check the next video {how to delete root node}

[@zainabbohra2915]

@@AmulsAcademy mam will you please 2 and 3 programs on recursion ,how calling is happening all that one by one ,basic recursion ,and yes mam old videos of recursion i had seen ,but i am little bit confusion it ,so please mam will you upload more videos on recursion ,

[@AmulsAcademy]

I will a make a video on that 😊

[@mamo100]

That is a WRONG binary search tree, because 500 can not be the right child of 300. You can see the BST in 07:00

[@codeitoff4334]

it can be..its >300

[@aswinks]

its correct

[@sinbad2597]

U wrong 🗿

[@donhjoe2162]

Are you a children or a girl? Thank for your help.

[@sinbad2597]

What in the 💀💀

[@shubhamjain1316]

You are greatest Amulya ma’am