test rank()

codezonediitj · Jul 7, 2024 · 2bad5e6 · 2bad5e6
1 parent 45853fc
commit 2bad5e6
Showing 1 changed file with 5 additions and 5 deletions.
diff --git a/pydatastructs/trees/tests/test_binary_trees.py b/pydatastructs/trees/tests/test_binary_trees.py
@@ -338,10 +338,10 @@ def _test_AVLTree(backend):
 
     assert a5.rank(-1) is None
     def test_select_rank(expected_output):
-        output = []
-        for i in range(len(expected_output)):
-            output.append(a5.select(i + 1).key)
-        assert output == expected_output
+        # output = []
+        # for i in range(len(expected_output)):
+        #     output.append(a5.select(i + 1).key)
+        # assert output == expected_output
         output = []
         expected_ranks = [i + 1 for i in range(len(expected_output))]
         for i in range(len(expected_output)):
@@ -388,7 +388,7 @@ def test_AVLTree():
     _test_AVLTree(backend=Backend.PYTHON)
 def test_cpp_AVLTree():
     _test_AVLTree(backend=Backend.CPP)
-
+test_cpp_AVLTree()
 def _test_BinaryIndexedTree(backend):
 
     FT = BinaryIndexedTree