GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-03 16:08: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/invert_tree/invert_tree_challenge.ipynb
View File

@@ -128,10 +128,10 @@
"outputs": [],
"source": [
"# %load test_invert_tree.py\n",
"from nose.tools import assert_equal\n",
"import unittest\n",
"\n",
"\n",
"class TestInvertTree(object):\n",
"class TestInvertTree(unittest.TestCase):\n",
"\n",
" def test_invert_tree(self):\n",
" root = Node(5)\n",
@@ -143,13 +143,13 @@
" node6 = bst.insert(6)\n",
" node9 = bst.insert(9)\n",
" result = bst.invert_tree()\n",
" assert_equal(result, root)\n",
" assert_equal(result.left, node7)\n",
" assert_equal(result.right, node2)\n",
" assert_equal(result.left.left, node9)\n",
" assert_equal(result.left.right, node6)\n",
" assert_equal(result.right.left, node3)\n",
" assert_equal(result.right.right, node1)\n",
" self.assertEqual(result, root)\n",
" self.assertEqual(result.left, node7)\n",
" self.assertEqual(result.right, node2)\n",
" self.assertEqual(result.left.left, node9)\n",
" self.assertEqual(result.left.right, node6)\n",
" self.assertEqual(result.right.left, node3)\n",
" self.assertEqual(result.right.right, node1)\n",
" print('Success: test_invert_tree')\n",
"\n",
"\n",
@@ -188,7 +188,7 @@
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.6.4"
"version": "3.7.2"
}
},
"nbformat": 4,

38
graphs_trees/invert_tree/invert_tree_solution.ipynb
View File

@@ -95,9 +95,7 @@
{
"cell_type": "code",
"execution_count": 1,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"%run ../bst/bst.py"
@@ -106,9 +104,7 @@
{
"cell_type": "code",
"execution_count": 2,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"class InverseBst(Bst):\n",
@@ -137,9 +133,7 @@
{
"cell_type": "code",
"execution_count": 3,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -151,10 +145,10 @@
],
"source": [
"%%writefile test_invert_tree.py\n",
"from nose.tools import assert_equal, assert_raises\n",
"import unittest\n",
"\n",
"\n",
"class TestInvertTree(object):\n",
"class TestInvertTree(unittest.TestCase):\n",
"\n",
" def test_invert_tree(self):\n",
" root = Node(5)\n",
@@ -166,13 +160,13 @@
" node6 = bst.insert(6)\n",
" node9 = bst.insert(9)\n",
" result = bst.invert_tree()\n",
" assert_equal(result, root)\n",
" assert_equal(result.left, node7)\n",
" assert_equal(result.right, node2)\n",
" assert_equal(result.left.left, node9)\n",
" assert_equal(result.left.right, node6)\n",
" assert_equal(result.right.left, node3)\n",
" assert_equal(result.right.right, node1)\n",
" self.assertEqual(result, root)\n",
" self.assertEqual(result.left, node7)\n",
" self.assertEqual(result.right, node2)\n",
" self.assertEqual(result.left.left, node9)\n",
" self.assertEqual(result.left.right, node6)\n",
" self.assertEqual(result.right.left, node3)\n",
" self.assertEqual(result.right.right, node1)\n",
" print('Success: test_invert_tree')\n",
"\n",
"\n",
@@ -188,9 +182,7 @@
{
"cell_type": "code",
"execution_count": 4,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -221,9 +213,9 @@
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.5.0"
"version": "3.7.2"
}
},
"nbformat": 4,
"nbformat_minor": 0
"nbformat_minor": 1
}

20
graphs_trees/invert_tree/test_invert_tree.py
View File

@@ -1,7 +1,7 @@
from nose.tools import assert_equal, assert_raises
import unittest
class TestInvertTree(object):
class TestInvertTree(unittest.TestCase):
def test_invert_tree(self):
root = Node(5)
@@ -13,13 +13,13 @@ class TestInvertTree(object):
node6 = bst.insert(6)
node9 = bst.insert(9)
result = bst.invert_tree()
assert_equal(result, root)
assert_equal(result.left, node7)
assert_equal(result.right, node2)
assert_equal(result.left.left, node9)
assert_equal(result.left.right, node6)
assert_equal(result.right.left, node3)
assert_equal(result.right.right, node1)
self.assertEqual(result, root)
self.assertEqual(result.left, node7)
self.assertEqual(result.right, node2)
self.assertEqual(result.left.left, node9)
self.assertEqual(result.left.right, node6)
self.assertEqual(result.right.left, node3)
self.assertEqual(result.right.right, node1)
print('Success: test_invert_tree')
@@ -29,4 +29,4 @@ def main():
if __name__ == '__main__':
main()
main()