From e3cc1ef49fe0d4ae31346bc7555bd639cfe45348 Mon Sep 17 00:00:00 2001 From: Kishan-Ved Date: Tue, 25 Jun 2024 18:46:02 +0530 Subject: [PATCH] CI check --- .../trees/tests/test_binary_trees.py | 22 ++++++++++--------- 1 file changed, 12 insertions(+), 10 deletions(-) diff --git a/pydatastructs/trees/tests/test_binary_trees.py b/pydatastructs/trees/tests/test_binary_trees.py index 4e9d115d..f7bfceac 100644 --- a/pydatastructs/trees/tests/test_binary_trees.py +++ b/pydatastructs/trees/tests/test_binary_trees.py @@ -529,11 +529,12 @@ def _test_SplayTree(backend): t.join(t1) assert str(t) == "[(None, 100, 100, None), '', (6, 200, 200, 8), (4, 50, 50, None), (5, 30, 30, None), (None, 20, 20, None), (3, 55, 55, 0), (None, 1000, 1000, None), (7, 2000, 2000, None), '']" - # trav3 = BinaryTreeTraversal(t, backend=backend) - # in_order = trav3.depth_first_search(order='in_order') - # pre_order = trav3.depth_first_search(order='pre_order') - # assert [node.key for node in in_order] == [20, 30, 50, 55, 100, 200, 1000, 2000] - # assert [node.key for node in pre_order] == [200, 55, 50, 30, 20, 100, 2000, 1000] + if(backend==Backend.PYTHON): + trav3 = BinaryTreeTraversal(t, backend=backend) + in_order = trav3.depth_first_search(order='in_order') + pre_order = trav3.depth_first_search(order='pre_order') + assert [node.key for node in in_order] == [20, 30, 50, 55, 100, 200, 1000, 2000] + assert [node.key for node in pre_order] == [200, 55, 50, 30, 20, 100, 2000, 1000] s = t.split(200) assert str(s) == "[(1, 2000, 2000, None), (None, 1000, 1000, None)]" @@ -544,11 +545,12 @@ def _test_SplayTree(backend): assert [node.key for node in in_order] == [1000, 2000] assert [node.key for node in pre_order] == [2000, 1000] - # trav5 = BinaryTreeTraversal(t, backend=backend) - # in_order = trav5.depth_first_search(order='in_order') - # pre_order = trav5.depth_first_search(order='pre_order') - # assert [node.key for node in in_order] == [20, 30, 50, 55, 100, 200] - # assert [node.key for node in pre_order] == [200, 55, 50, 30, 20, 100] + if(backend==Backend.PYTHON): + trav5 = BinaryTreeTraversal(t, backend=backend) + in_order = trav5.depth_first_search(order='in_order') + pre_order = trav5.depth_first_search(order='pre_order') + assert [node.key for node in in_order] == [20, 30, 50, 55, 100, 200] + assert [node.key for node in pre_order] == [200, 55, 50, 30, 20, 100] def test_SplayTree(): _test_SplayTree(Backend.PYTHON)