def test_insert_and_search(self): bst = Tree() bst.insert(5) self.assertEqual(bst.search(5), True) bst.insert(15) self.assertEqual(bst.search(15), True) bst.insert(6) bst.insert(7) self.assertEqual(bst.search(6), True)
insert(tree, lst) # [50, 60, 70, 80, 90, 100] t.assertAlmostEqual(None, tree.inorder_successor(20)) t.assertAlmostEqual(60, tree.inorder_successor(50)) t.assertAlmostEqual(None, tree.inorder_successor(55)) t.assertAlmostEqual(70, tree.inorder_successor(60)) t.assertAlmostEqual(None, tree.inorder_successor(65)) t.assertAlmostEqual(80, tree.inorder_successor(70)) t.assertAlmostEqual(None, tree.inorder_successor(85)) t.assertAlmostEqual(100, tree.inorder_successor(90)) t.assertAlmostEqual(None, tree.inorder_successor(95)) t.assertAlmostEqual(None, tree.inorder_successor(100)) t.assertAlmostEqual(None, tree.inorder_successor(110)) tree = Tree() tree.search(50) node100 = TreeNode(100) node50 = TreeNode(50) node200 = TreeNode(200) node25 = TreeNode(25) node125 = TreeNode(125) node350 = TreeNode(350) node50.left = node25 node200.left = node125 node200.right = node350 node100.left = node50 node100.right = node200 tree.root = node100 t.assertEqual(id(node100), id(tree.search(100)))