more changes

Author: Kishan-Ved

pydatastructs/trees/tests/test_binary_trees.py

@@ -260,10 +260,12 @@ def _test_BinarySearchTree(backend):
     b.insert(-7, 7)
     b.insert(-14, 14)
     b.insert(-13, 13)
-    assert b.delete(-13) is True
-    assert b.delete(-10) is True
-    assert b.delete(-3) is True
-    assert b.delete(-13) is None
+
+    b.delete(-13)
+    b.delete(-10)
+    b.delete(-3)
+    b.delete(-13)
+
     bl = BST(backend=backend)
     nodes = [50, 30, 90, 70, 100, 60, 80, 55, 20, 40, 15, 10, 16, 17, 18]
     for node in nodes: