def test_is_bst(self): bst = build_bst_from_list([n for n in range(1, 16)]) tree = TreeNode(1, TreeNode(2, TreeNode(3), TreeNode(4)), TreeNode(5, TreeNode(6), TreeNode(7))) print(bst.print_structure()) print(tree.print_structure()) self.assertTrue(is_bst(bst)) self.assertFalse(is_bst(tree))
class TestBinaryTree(unittest.TestCase): def setUp(self): self.tree = TreeNode(1, TreeNode(2, TreeNode(3, TreeNode(4), TreeNode(5)), TreeNode(6, TreeNode(7), TreeNode(8))), TreeNode(9, TreeNode(10, TreeNode(11), TreeNode(12)), TreeNode(13, TreeNode(14), TreeNode(15)))) def test_print(self): print(self.tree.print_structure()) def test_traverse(self): self.tree.traverse(do_dfs_r)
def test_find_sum(self): tree = TreeNode(1, TreeNode(2, TreeNode(3), TreeNode(4)), TreeNode(5, TreeNode(6), TreeNode(7))) print(tree.print_structure()) find_sum(tree, 3)