def test_delete_one_child(self): tree = BinarySearchTree(10) tree.insert(20) tree.insert(17) tree.insert(11) tree.insert(19) tree.deleteNode(tree, 19) self.assertEqual(tree.toList(), [10,20, 17, 11])
def test_delete_two_childs(self): tree = BinarySearchTree(10) tree.insert(20, 0, 100, 50, 30, 17) print("\ntest tree") tree.printHierarchy() print("\nDepth") print(tree.getDepth()) tree.deleteNode(tree,20) print("\nremoved node with data == 20") tree.printHierarchy()
def test_delete_leaf(self): tree = BinarySearchTree(10) tree.insert(20) tree.deleteNode(tree,20) self.assertEqual(tree.toList(), [10])