def test_bst_remove_all_items_of_balanced_tree_with_3_items(self):
bst = BinarySearchTree()
bst.insert(26)
bst.insert(25)
bst.insert(27)
bst.remove(27)
bst.remove(25)
root = bst.remove(26)
self.assertEquals(root, None)
self.assertEquals(bst.height, 0)
self.assertEquals(bst.size, 0)
def test_bst_remove_all_items_of_balanced_tree_with_3_items(self):
bst = BinarySearchTree()
bst.insert(26)
bst.insert(25)
bst.insert(27)
bst.remove(27)
bst.remove(25)
root = bst.remove(26)
self.assertEquals(root, None)
self.assertEquals(bst.height, 0)
self.assertEquals(bst.size, 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)
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)
def test_bst_remove_root_from_tree_with_larger_leaf(self):
bst = BinarySearchTree()
bst.insert(23)
bst.insert(24)
root = bst.remove(23)
self.assertEquals(root.value, 24)
self.assertEquals(bst.height, 1)
self.assertEquals(bst.size, 1)
def test_bst_remove_larger_leaf_from_tree_with_2(self):
bst = BinarySearchTree()
bst.insert(19)
bst.insert(20)
root = bst.remove(20)
self.assertEquals(root.value, 19)
self.assertEquals(bst.height, 1)
self.assertEquals(bst.size, 1)
def test_bst_remove_smaller_leaf_from_tree_with_2(self):
bst = BinarySearchTree()
bst.insert(18)
bst.insert(17)
root = bst.remove(17)
self.assertEquals(root.value, 18)
self.assertEquals(bst.height, 1)
self.assertEquals(bst.size, 1)
def test_bst_remove_root_from_tree_with_larger_leaf(self):
bst = BinarySearchTree()
bst.insert(23)
bst.insert(24)
root = bst.remove(23)
self.assertEquals(root.value, 24)
self.assertEquals(bst.height, 1)
self.assertEquals(bst.size, 1)
def test_bst_remove_larger_leaf_from_tree_with_2(self):
bst = BinarySearchTree()
bst.insert(19)
bst.insert(20)
root = bst.remove(20)
self.assertEquals(root.value, 19)
self.assertEquals(bst.height, 1)
self.assertEquals(bst.size, 1)
def test_bst_remove_smaller_leaf_from_tree_with_2(self):
bst = BinarySearchTree()
bst.insert(18)
bst.insert(17)
root = bst.remove(17)
self.assertEquals(root.value, 18)
self.assertEquals(bst.height, 1)
self.assertEquals(bst.size, 1)
def test_bst_remove__single_tree_item(self):
bst = BinarySearchTree()
bst.insert(16)
root = bst.remove(16)
was_found = bst.query(16)
self.assertEquals(root, None)
self.assertEquals(was_found, False)
self.assertEquals(bst.height, 0)
self.assertEquals(bst.size, 0)
def test_bst_remove__single_tree_item(self):
bst = BinarySearchTree()
bst.insert(16)
root = bst.remove(16)
was_found = bst.query(16)
self.assertEquals(root, None)
self.assertEquals(was_found, False)
self.assertEquals(bst.height, 0)
self.assertEquals(bst.size, 0)
def test_bst_remove_root_with_left_and_right_children(self):
bst = BinarySearchTree()
bst.insert(29)
bst.insert(28)
bst.insert(30)
root = bst.remove(29)
self.assertEquals(bst.size, 2)
self.assertEquals(root.value, 28)
self.assertEquals(root.right.value, 30)
self.assertEquals(root.left, None)
def test_bst_remove_root_with_left_and_right_children(self):
bst = BinarySearchTree()
bst.insert(29)
bst.insert(28)
bst.insert(30)
root = bst.remove(29)
self.assertEquals(bst.size, 2)
self.assertEquals(root.value, 28)
self.assertEquals(root.right.value, 30)
self.assertEquals(root.left, None)
def test_bst_remove_inexistent_item(self):
bst = BinarySearchTree()
was_removed = bst.remove(15)
self.assertEquals(was_removed, False)
def test_bst_remove_inexistent_item(self):
bst = BinarySearchTree()
was_removed = bst.remove(15)
self.assertEquals(was_removed, False)
