def test_1(self): for test in self.tests: treeRoot = BinaryTreeNode.buildTree(test[0], test[1]) levelLists = createLevelLinkedLists(treeRoot) levelLists2 = createLevelLinkedListsBFS(treeRoot) for i in range(len(test[2])): self.assertEqual(str(test[2][i]), str(levelLists[i])) self.assertEqual(str(test[2][i]), str(levelLists2[i]))
def test_1(self): for test in self.tests: treeRoot = BinaryTreeNode.buildTree(test[0], test[1]) levelLists = createLevelLinkedLists(treeRoot) levelLists2 = createLevelLinkedListsBFS(treeRoot) for i in range(len(test[2])): self.assertEqual(str(test[2][i]), str(levelLists[i])) self.assertEqual(str(test[2][i]), str(levelLists2[i]))
def test_1(self): for test in self.tests: t1 = BinaryTreeNode.buildTree(test[0], test[1]) result = findSums(t1, test[2]) self.assertEqual(result, test[3])
def test_1(self): for test in self.tests: t1 = BinaryTreeNode.buildTree(test[0], test[1]) t2 = BinaryTreeNode.buildTree(test[2], test[3]) self.assertEquals(isSubtree(t1, t2), test[4])
def test_1(self): root = BinaryTreeNode.buildTree([1, 2, 3], [2, 1, 3]) self.assertEqual(inOrderSuccessor(root.left).key, 1)
def test_3(self): root = BinaryTreeNode.buildTree([1, 2, 3], [2, 1, 3]) self.assertEqual(inOrderSuccessor(root.right), None)
def test_1(self): root = BinaryTreeNode.buildTree([1, 2, 3], [2, 1, 3]) self.assertEqual(commonAncestor(root, root.left, root.right), root)
def test_3(self): root = BinaryTreeNode.buildTree([1, 2, 3], [3, 2, 1]) self.assertEqual(commonAncestor(root, root.left, root.left), root.left)
def test_1(self): root = BinaryTreeNode.buildTree([1, 2, 3], [2, 1, 3]) self.assertEqual(inOrderSuccessor(root.left).key, 1)
def test_3(self): root = BinaryTreeNode.buildTree([1, 2, 3], [2, 1, 3]) self.assertEqual(inOrderSuccessor(root.right), None)
def test_1(self): for test in self.tests: root = BinaryTreeNode.buildTree(test[1], test[0]) self.assertEqual(isBST(root), test[2]) self.assertEqual(isBST2(root), test[2])
def test_1(self): for test in self.tests: t1 = BinaryTreeNode.buildTree(test[0], test[1]) result = findSums(t1, test[2]) self.assertEqual(result, test[3])
def test_1(self): for test in self.tests: t1 = BinaryTreeNode.buildTree(test[0], test[1]) t2 = BinaryTreeNode.buildTree(test[2], test[3]) self.assertEquals(isSubtree(t1, t2), test[4])