def test_insert_and_delete_tree(self): bst = BinarySearchTree(10) bst.insert(20) self.assertEqual(bst.size(), 2) bst = bst.delete(20) self.assertEqual(bst.size(), 1) bst = bst.delete(10) self.assertEqual(bst.size(), 0)
def test_delete_root_node(self): bst = BinarySearchTree(10) bst.insert(20) bst.insert(30) bst.insert(5) bst.insert(9) self.assertEqual(bst.size(), 5) bst = bst.delete(10) self.assertEqual(bst.size(), 4)
def test_delete_tree_size_1(self): bst = BinarySearchTree(10) self.assertEqual(bst.size(), 1) bst.delete(10) self.assertEqual(bst.size(), 0)
def test_insert_multiple_items_from_nonempty_tree(self): bst = BinarySearchTree(20) bst.insert(10) bst.insert(30) bst.insert(5) self.assertEqual(bst.size(), 4)
def test_insert_from_nonempty_tree(self): bst = BinarySearchTree(10) bst.insert(20) self.assertEqual(bst.size(), 2)
def test_nonempty_tree(self): bst = BinarySearchTree(20) self.assertEqual(bst.size(), 1)
def test02_Incert(self): binarytree = BinarySearchTree() binarytree.setData(10) binarytree.insert(17) self.assertEqual(binarytree.size(), 2)