Simpilfied bst challenge.

This commit is contained in:
Donne Martin
2015-08-01 17:44:14 -04:00
parent e55c7ee1c6
commit 31058abf3a
5 changed files with 106 additions and 63 deletions

View File

@@ -86,15 +86,8 @@
" def __init__(self, data):\n",
" # TODO: Implement me\n",
"\n",
" def insert(self, data):\n",
" # TODO: Implement me\n",
"\n",
" def in_order_traversal(self, visit_func):\n",
" if self.left is not None:\n",
" self.left.in_order_traversal(visit_func)\n",
" visit_func(self.data)\n",
" if self.right is not None:\n",
" self.right.in_order_traversal(visit_func)"
"def insert(root, data):\n",
" # TODO: Implement me"
]
},
{
@@ -122,6 +115,17 @@
"%run ../utils/captured_output.py"
]
},
{
"cell_type": "code",
"execution_count": null,
"metadata": {
"collapsed": true
},
"outputs": [],
"source": [
"%run dfs.py"
]
},
{
"cell_type": "code",
"execution_count": null,
@@ -138,24 +142,24 @@
"class TestTree(object):\n",
"\n",
" def test_tree(self):\n",
" root = Node(5)\n",
" root.insert(2)\n",
" root.insert(8)\n",
" root.insert(1)\n",
" root.insert(3)\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",
" root.in_order_traversal(sys.stdout.write)\n",
" in_order_traversal(node, sys.stdout.write)\n",
" assert_equal(out.getvalue().strip(), '12358')\n",
"\n",
" root = Node(1)\n",
" root.insert(2)\n",
" root.insert(3)\n",
" root.insert(4)\n",
" root.insert(5)\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",
" root.in_order_traversal(sys.stdout.write)\n",
" in_order_traversal(node, sys.stdout.write)\n",
" assert_equal(out.getvalue().strip(), '12345')\n",
"\n",
" print('Success: test_tree')\n",