Python Program To Implement Binary Search Tree | Program 6 | Deletion | Example

In this Python Programming video tutorial you will learn how to implement binary search tree in detail.
Data structure is a way of storing and organising the data so that it can be accessed effectively.
Tree is a non linear data structure contains group of nodes connected via links or edge.
Binary search tree is a special type of binary tree . Here we will use class and object concept to implement binary search tree. In this tutorial we will see how to delete given node in tree.
#DataStructures #PythonPrograms #Tree
For more free tutorials on computer programming
/ amulsacademy
AmulsAcademy

[@samridhshubham8109]

You know exactly which part we didn't get and then explain that part....sign of someone who themselves struggled to learn things... Absolutely amazing teacher👐!! Your playlist has helped me a lot, many many thanks for helping us out.

[@AmandeepSingh-uq3wp]

Thanks for making Data structures and algorithms lectures in python. Thanks A Lot!!! Please complete the whole DSA playlist.

[@Arjunsingh-ne7lo]

thankyou mam best series ever, no one upload python datastructure but you have upload it. Thanks mam to building my basic concept remember forever

[@AmulsAcademy]

Pleasure 😊

[@Arjunsingh-ne7lo]

Mam please start few array problem series releted to interview ask

[@rakshitharakshitha6912]

One of the best explanation I've ever seen... Thanks so much Amulya... All the videos are really helpful. You explained each and every point..... thanks a million... Thanks from New York

[@martinflavell3045]

code on the left, example on the right = the best possible presentation/analysis. TYVM!

[@PrinceKumar-tl2ut]

your explanation is superrrrr ❤ , you are way better than those paid data structure courses

[@AmulsAcademy]

Haha… thank you 😊❤️

[@peladixon]

you are the best teacher ever

[@sivasrimakurthi206]

@amulya - I particularly like the step-by-step navigation of the code, to explain the logic line by line. this is great work. Keep it up!

[@SnapSHORT1]

I just wanna say one thing . this explanation is damn 🔥

[@AmulsAcademy]

Thank you 😊

[@sonnetsandsmiles]

thanks soooooooo much.. i was really confused before watching this this video.. i really thank uuu

[@AmulsAcademy]

Pleasure 😊

[@ashwinkumarramaswamy9369]

Such a great explanation madam Awesome I just worried about last video how the deletion functionality comes in else part now its cleared!!!! Thank you so much ! 🤗

[@AmulsAcademy]

😊❤️

[@KartikKothari-j1r]

Hi, your explanation is great. Thank you for putting so much effort and thanks again. I will complete and see your other tutorials too.

[@demondeadpool331]

i like the way you explain concepts like this and your voice too

[@WeloveKoora]

thank you so much

[@mantolbaloch4948]

Mam, your vedios have been very helpful to get the concept of Data structure 👍

[@Anurag-kp6wc]

Thanks a ton, Ma'am. You're the best.

[@AmulsAcademy]

Thank you 😊

[@vachapatel9874]

best teaching ever ma'am!!! ❤❤❤

[@AmulsAcademy]

Thank you 😊❤️

[@lohir446]

Awesome work, really appreciate your effort on the content

[@akshrags-mindmaze3407]

Nice explanation using diagram

[@manthangandalwad4251]

Thank you for teaching us mam ..... Please upload remaining videos of data structure..

[@AmulsAcademy]

Soon 😊

[@aswath8265]

Great explanation 🔥🔥 amazing really shocked

[@AmulsAcademy]

Thank you 😊

[@naveenchebolu6757]

Your videos are awesome after completion of data structures do the same for oops concepts also .

[@AmulsAcademy]

Sure 😊

[@johnsonabel5708]

Good. I love this please can you do video on big O notation???

[@AmulsAcademy]

Thank you , will try 😊

[@bhargav1811]

Nice explaination !!!

[@ujjwalshrivastava8368]

Great fan mam😍😍😍

[@settyruthvik6236]

awesome explanation mam

[@Futball860]

This is so helpful. Thank you so much :)

[@chiragbansal3228]

Mam, please upload lectures on AVL Trees

[@prashanthveddula9307]

Thanks a lot for this explanation !

[@AmulsAcademy]

Pleasure 😊

[@AmitYadav-vr3zx]

awesome explaination 🔥

[@ngocloile6641]

excellent explanation!, wish you do video about algorithm | Python, tks you!

[@AmulsAcademy]

Thank you 😊

[@snr-u6h]

thanks mam...keep completing DS.

[@AmulsAcademy]

Sure 😊

[@tareqoweinat5952]

awesome, thank you very much

[@bikeshregmi946]

Good Explanation!

[@AmulsAcademy]

Thank you 😊

[@moulee007]

can you please make a playlist on hashing , hash table is also a data structure right ?

[@saranyav5244]

Mam plz upload...software c c++ python install

[@AmulsAcademy]

Noted 😊

[@TechInShort]

Will you post Django tutorial or do you know any best tutorial for Django?

[@zainabbohra2915]

geekyshows

[@idk____idk6530]

Mam can you make tutorial on TKINTER ...

[@AmulsAcademy]

Will try 😊

[@vijays-rd8uc]

Thank you

[@rathnanaikrathnanaik]

nice mam

[@shahrukh3531]

Is this approach standard or is it your personal approach to delete? I have made a program to find parent of node by searching first then delete it's child.

[@sasivardhanbonthu8159]

mam in last you returned" return self" what is meaning of that and what it will returns

[@subhasis._khuntia]

in the else part why we are assigning self=None is it necessary to do this? is by skipping self=None affect the result?

[@AmulsAcademy]

I think you will get same answer 😊 Here to give you the feeling of deletion we used that 😊

[@subhasis._khuntia]

@@AmulsAcademy thanks

[@tridontridens5642]

How to make brute force?..plz create tutorial plz...

[@AmulsAcademy]

Noted 😊

[@selvanm2872]

👍👍👍

[@AmulsAcademy]

Thank you 😊

[@prachi7414]

Ma’am i so confused about the return self at last , how it is affecting the program i am not getting it!!! Please help me

[@srikanthnethavath5807]

Mam can I get pdf what you are explaining

[@ishanmukherjee3962]

Madam there are some problem in the code that need to be fixed. Hope you will find this comment helpful.

[@AmulsAcademy]

Hey, getting any error? Please specify 😊

[@cainsharma2104]

@@AmulsAcademy This particular delete function is deleting more keys than the one specified. This is deleting the root, the parent of the mentioned key and the key itself. root = BST(333) print("In Order Traversal") root.inorder() print("-----") myList = [20,30,40,1,2,6,15,17] for i in myList: root.insert_key(i) root.insert_key(1140) print("In Order Traversal") root.inorder() print("-----") root.search_key(17) root.search_key(20) print("Deleting Node 17") root.delete_key(17) #print("Pre Order Traversal") #root.preorder() print("-----") print("In Order Traversal") root.inorder()

[@zainabbohra2915]

mam what happen if we not write self, what self is doing , i am talking about return self in last line not getting that line.will you please explain , i also run on idle without using return self in last line. and its give me wrong result

[@AmulsAcademy]

Hey in the next video I explained about that with example 😊

[@zainabbohra2915]

Always greatful ,Thank you so much mam💖💖

[@aravindhan9183]

this program wont work when the tree is like preorder--20 15 10 7 17 16 when we delete 15 from the tree

[@priyanshushrimal5419]

This method doesn't work when the root node has less than 2 children. Take a look at this code in addition to yours: def build_tree(elements): root = BST(elements[0]) for i in range(1, len(elements)): root.add_child(elements[i]) return root numbers = [15,20,222] number_list = build_tree(numbers) print(number_list.in_order_traversal()) number_list.delete(15) print("after deleting 15: ", number_list.in_order_traversal()) #15 doesn't get deleted.# Here's the full code incase you want it: #deleting a node class BinarySearchTreeNode: def __init__(self, data): self.data = data self.left = None self.right = None def add_child(self, data): if data == self.data: return elif data < self.data: #add data in left subtree if self.left: self.left.add_child(data) else: self.left = BinarySearchTreeNode(data) else: #add in right subtree if self.right: self.right.add_child(data) else: self.right = BinarySearchTreeNode(data) def in_order_traversal(self): elements = [] #visit left tree if self.left: elements += self.left.in_order_traversal() #visit base elements.append(self.data) #visit right tree if self.right: elements += self.right.in_order_traversal() return elements def search(self, value): if self.data == value: return True elif value < self.data: if self.left: return self.left.search(value) else: return False else: if self.right: return self.right.search(value) else: return False def find_min(self): if self.left: return self.left.find_min() else: return self.data def find_max(self): if self.right: return self.right.find_max() else: return self.data def delete(self, data): if self.data == None: print("Tree is empty") return if data < self.data: if self.left: self.left = self.left.delete(data) else: print("Not present") elif data > self.data: if self.right: self.right = self.right.delete(data) else: print("Not present") else: if self.left == None: temp = self.right self = None return temp if self.right is None: temp = self.left self = None return temp node = self.right while node.left: node = node.left self.data = node.data self.right = self.right.delete(node.data) return self def build_tree(elements): root = BinarySearchTreeNode(elements[0]) for i in range(1, len(elements)): root.add_child(elements[i]) return root numbers = [15,20,222] number_list = build_tree(numbers) print(number_list.in_order_traversal()) number_list.delete(15) print("after deleting 15: ", number_list.in_order_traversal())

[@AmulsAcademy]

Thanks for informing 😊 I will check that 😊

[@vinaybandaru3994]

@@AmulsAcademy mam I got it, just equal the return value of delete function to the same object itself like... according to the code in the video numbers = [15,20,222] obj = BST(None) for i in numbers: obj.insert(i) obj = obj.delete(15) 👍👍

[@manojkumarm9554]

I have a doubt! If 98 had two childs, 95 =left child and 110 = right child, now 95 will be the smallest in RST ,so now in place of 10(root) we should have (95) and after deleting smallest(95) in RST we will be returning none to the rchild of root ,since rchild of root is none the root will not have rchild so where is 98 and 110.

[@manojkumarm9554]

Here i want to delete 10

[@akshrags-mindmaze3407]

No. At 10:17 you can see, that if self.lchild is None, then only None will be returned, but in your case both lchild and rchild are not None(so both if statements will not execute) , so again node=self.rchild get executed and belew lines will execute , and as a result, the tree will be rearranged and finally last leaf node's rchild and lchild will only be set to None. Hope you understood!

[@zainabbohra2915]

mam why you made 76 and 77 video private?

[@AmulsAcademy]

Really ? Let me check 😊 All videos are public, please mention the video name 😊

[@zainabbohra2915]

@@AmulsAcademy mam now it is showing 76 video is private and 77 is public but till yesterday it is showing both videos are private

[@zainabbohra2915]

@@AmulsAcademy sure mam

[@iluminatibox9949]

WOWWWWWW!!!! you are the most well explained with details, I understand everysteps because of your explain . I would like if there is any possible chance you could make a vide explain this much detail in question 108 leetcode. I have a copy of Neetcode doing that question right here but his video was not clear so I can't understand much about how he got mid=1 so nums[1]=3. I would pay 40 CA for that vid through paypal!! I hope you can accept my request because I'm very weak as Tree and people on reddit and my teacher does not explain it clear enough for me. Thx here is his code: class Solution: def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]: def bst(l,r): if l>r: return mid=(l+r)//2 print(nums[mid]) nn=TreeNode(nums[mid]) nn.left=bst(l,mid-1) nn.right=bst(mid+1,r) return nn return bst(0,len(nums)-1) Thank you so much!!!!!!!

[@a_36_rajdeep_ray12]

Awesome explanation ❤