def test_bst_with_complex_tree(self):
     bst = BinarySearchTree()
     values_list = [6, 8, 2, 1, 4, 3]
     bst.insert_list(values_list)
     root = bst.remove(6)
     self.assertEquals(bst.size, 5)
     self.assertEquals(root.value, 4)
Example #2
0
 def test_bst_with_complex_tree(self):
     bst = BinarySearchTree()
     values_list = [6, 8, 2, 1, 4, 3]
     bst.insert_list(values_list)
     root = bst.remove(6)
     self.assertEquals(bst.size, 5)
     self.assertEquals(root.value, 4)
Example #3
0
 def test_bst_to_string_tree_with_7_nodes(self):
     bst = BinarySearchTree()
     values_list = [4, 2, 1, 3, 6, 5, 7]
     bst.insert_list(values_list)
     printlines = bst.to_string(bst.root)
     self.assertEquals(printlines, TREE_WITH_7)
Example #4
0
 def test_bst_max_values_list(self):
     bst = BinarySearchTree()
     values_list = [7, 3, 4, 1, 6, 8, 2, 9, 5]
     bst.insert_list(values_list)
     self.assertEqual(bst.max.value, 9)
Example #5
0
 def test_bst_min_values_list(self):
     bst = BinarySearchTree()
     values_list = [9, 3, 4, 1, 6, 8, 2, 7, 5]
     bst.insert_list(values_list)
     self.assertEqual(bst.min.value, 1)
 def test_bst_to_string_tree_with_7_nodes(self):
     bst = BinarySearchTree()
     values_list = [4, 2, 1, 3, 6, 5, 7]
     bst.insert_list(values_list)
     printlines = bst.to_string(bst.root)
     self.assertEquals(printlines, TREE_WITH_7)
 def test_bst_max_values_list(self):
     bst = BinarySearchTree()
     values_list = [7, 3, 4, 1, 6, 8, 2, 9, 5]
     bst.insert_list(values_list)
     self.assertEqual(bst.max.value, 9)
 def test_bst_min_values_list(self):
     bst = BinarySearchTree()
     values_list = [9, 3, 4, 1, 6, 8, 2, 7, 5]
     bst.insert_list(values_list)
     self.assertEqual(bst.min.value, 1)