def setUp(self):
self.option = 1
if self.option == 1:
self.avl = AVLTree()
elif self.option == 2:
self.avl = AVLTree()
self.results = Results()
class TestBinarySearchTreeBfs(unittest.TestCase):
def tearDown(self):
self.bst = None
self.results = None
def setUp(self):
self.bst = BinarySearchTreeBfs()
self.results = Results()
def test_bst(self):
node_datas = [5, 2, 8, 1, 3, 9, 7, 6]
for node_data in node_datas:
self.bst.insert(node_data)
self.assertEqual(self.bst.root.val, 5)
self.bst.bfs(self.results.add_result)
self.assertEqual(self.results.results, [5, 2, 8, 1, 3, 7, 9, 6])
self.results.clean_results()
def test_reconstruct_bt():
rbt = ReconstructBinaryTree()
preorder = [1, 2, 4, 7, 3, 5, 6, 8]
inorder = [4, 7, 2, 1, 5, 3, 8, 6]
bt = rbt.construct(preorder, inorder)
traversal = Traversal()
results = Results()
traversal.in_order_traversal(bt, results.add_result)
print(results.results)
class TestBinarySearchTree(unittest.TestCase):
def tearDown(self):
self.bst = None
self.results = None
def setUp(self):
self.bst = BinarySearchTree()
self.results = Results()
self.traversal = Traversal()
def test_bst(self):
node_datas = [5, 2, 8, 1, 3]
for node_data in node_datas:
self.bst.insert(node_data)
self.assertEqual(self.bst.root.val, 5)
self.traversal.in_order_traversal(self.bst.root,
self.results.add_result)
self.assertEqual(self.results.results, [1, 2, 3, 5, 8])
self.results.clean_results()
self.traversal.pre_order_traversal(self.bst.root,
self.results.add_result)
self.assertEqual(self.results.results, [5, 2, 1, 3, 8])
self.results.clean_results()
self.traversal.post_order_traversal(self.bst.root,
self.results.add_result)
self.assertEqual(self.results.results, [1, 3, 2, 8, 5])
self.results.clean_results()
def setUp(self):
self.bst = InvertBst()
self.results = Results()
def setUp(self):
self.bst = InOrderSuccessorBst()
self.traversal = Traversal()
self.results = Results()
def setUp(self):
self.bst = ValidateBst()
self.results = Results()
self.traversal = Traversal()
def setUp(self):
self.bst = BinarySearchTree()
self.results = Results()
self.traversal = Traversal()
def setUp(self):
self.bst = MinBst()
self.traversal = Traversal()
self.results = Results()
def setUp(self):
self.bst = BinarySearchTreeBfs()
self.results = Results()