GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-07 01:48:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

#273: Remove nose dependency for graphs_trees/ (#277)

Browse Source
This commit is contained in:
Donne Martin
2020-07-10 21:02:32 -04:00
committed by GitHub
parent 139e157250
commit abf7524c26
67 changed files with 860 additions and 1027 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
graphs_trees/tree_lca/test_lca.py
View File

@@ -1,7 +1,7 @@
from nose.tools import assert_equal
import unittest
class TestLowestCommonAncestor(object):
class TestLowestCommonAncestor(unittest.TestCase):
def test_lca(self):
node10 = Node(10)
@@ -26,13 +26,13 @@ class TestLowestCommonAncestor(object):
root = node10
node0 = Node(0)
binary_tree = BinaryTree()
assert_equal(binary_tree.lca(root, node0, node5), None)
assert_equal(binary_tree.lca(root, node5, node0), None)
assert_equal(binary_tree.lca(root, node1, node8), node3)
assert_equal(binary_tree.lca(root, node12, node8), node5)
assert_equal(binary_tree.lca(root, node12, node40), node10)
assert_equal(binary_tree.lca(root, node9, node20), node9)
assert_equal(binary_tree.lca(root, node3, node5), node5)
self.assertEqual(binary_tree.lca(root, node0, node5), None)
self.assertEqual(binary_tree.lca(root, node5, node0), None)
self.assertEqual(binary_tree.lca(root, node1, node8), node3)
self.assertEqual(binary_tree.lca(root, node12, node8), node5)
self.assertEqual(binary_tree.lca(root, node12, node40), node10)
self.assertEqual(binary_tree.lca(root, node9, node20), node9)
self.assertEqual(binary_tree.lca(root, node3, node5), node5)
print('Success: test_lca')
@@ -42,4 +42,4 @@ def main():
if __name__ == '__main__':
main()
main()