Modified BST

OmkarPathak · OmkarPathak · commit aa57bc1a33bc · 2017-09-19T21:00:10.000+05:30
diff --git a/Trees/BinarySearchTree.py b/Trees/BinarySearchTree.py
@@ -47,7 +47,7 @@ def minValueNode(self, node):
     def delete(self, data):
         ''' For deleting the node '''
         if self is None:
-            return root
+            return None
 
         # if current node's data is less than that of root node, then only search in left subtree else right subtree
         if data < self.data:
