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

Reworked bst unit tests.

Browse Source
This commit is contained in:
Donne Martin
2015-08-04 19:33:42 -04:00
parent 9dc4116256
commit 72e133a96c
3 changed files with 35 additions and 34 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
graphs_trees/bst/bst_challenge.ipynb
View File

@@ -85,9 +85,12 @@
"\n",
" def __init__(self, data):\n",
" # TODO: Implement me\n",
" pass\n",
"\n",
"\n",
"def insert(root, data):\n",
" # TODO: Implement me"
" # TODO: Implement me\n",
" pass"
]
},
{
@@ -112,7 +115,7 @@
},
"outputs": [],
"source": [
"%run ../utils/captured_output.py"
"%run dfs.py"
]
},
{
@@ -123,7 +126,7 @@
},
"outputs": [],
"source": [
"%run dfs.py"
"%run ../utils/results.py"
]
},
{
@@ -135,32 +138,31 @@
"outputs": [],
"source": [
"# %load test_bst.py\n",
"from __future__ import print_function\n",
"from nose.tools import assert_equal\n",
"\n",
"\n",
"class TestTree(object):\n",
"\n",
" def __init__(self):\n",
" self.results = Results()\n",
"\n",
" def test_tree(self):\n",
" node = Node(5)\n",
" insert(node, 2)\n",
" insert(node, 8)\n",
" insert(node, 1)\n",
" insert(node, 3)\n",
"\n",
" with captured_output() as (out, err):\n",
" in_order_traversal(node, sys.stdout.write)\n",
" assert_equal(out.getvalue().strip(), '12358')\n",
" in_order_traversal(node, self.results.add_result)\n",
" assert_equal(str(self.results), '[1, 2, 3, 5, 8]')\n",
" self.results.clear_results()\n",
"\n",
" node = Node(1)\n",
" insert(node, 2)\n",
" insert(node, 3)\n",
" insert(node, 4)\n",
" insert(node, 5)\n",
"\n",
" with captured_output() as (out, err):\n",
" in_order_traversal(node, sys.stdout.write)\n",
" assert_equal(out.getvalue().strip(), '12345')\n",
" in_order_traversal(node, self.results.add_result)\n",
" assert_equal(str(self.results), '[1, 2, 3, 4, 5]')\n",
"\n",
" print('Success: test_tree')\n",
"\n",