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

Revised bfs challenge to be more self contained for simplicity.

Browse Source
This commit is contained in:
Donne Martin
2015-08-01 16:47:29 -04:00
parent a0b6421f79
commit 69f68287e3
2 changed files with 39 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
graphs_trees/tree_bfs/bfs_challenge.ipynb
View File

@@ -71,7 +71,24 @@
}, },
"outputs": [], "outputs": [],
"source": [ "source": [
"class MyNode(Node):\n", "class Node(object):\n",
"\n",
" def __init__(self, data):\n",
" self.data = data\n",
" self.left = None\n",
" self.right = None\n",
"\n",
" def insert(self, data):\n",
" if data <= self.data:\n",
" if self.left is None:\n",
" self.left = Node(data)\n",
" else:\n",
" self.left.insert(data)\n",
" else:\n",
" if self.right is None:\n",
" self.right = Node(data)\n",
" else:\n",
" self.right.insert(data)\n",
"\n", "\n",
" def bfs(self, visit_func):\n", " def bfs(self, visit_func):\n",
" # TODO: Implement me" " # TODO: Implement me"

36
graphs_trees/tree_bfs/bfs_solution.ipynb
View File

@@ -76,17 +76,6 @@
{ {
"cell_type": "code", "cell_type": "code",
"execution_count": 1, "execution_count": 1,
"metadata": {
"collapsed": true
},
"outputs": [],
"source": [
"%run ../bst/bst.py"
]
},
{
"cell_type": "code",
"execution_count": 2,
"metadata": { "metadata": {
"collapsed": false "collapsed": false
}, },
@@ -95,7 +84,24 @@
"from collections import deque\n", "from collections import deque\n",
"\n", "\n",
"\n", "\n",
"class MyNode(Node):\n", "class Node(object):\n",
"\n",
" def __init__(self, data):\n",
" self.data = data\n",
" self.left = None\n",
" self.right = None\n",
"\n",
" def insert(self, data):\n",
" if data <= self.data:\n",
" if self.left is None:\n",
" self.left = Node(data)\n",
" else:\n",
" self.left.insert(data)\n",
" else:\n",
" if self.right is None:\n",
" self.right = Node(data)\n",
" else:\n",
" self.right.insert(data)\n",
"\n", "\n",
" def bfs(self, visit_func):\n", " def bfs(self, visit_func):\n",
" queue = deque()\n", " queue = deque()\n",
@@ -118,7 +124,7 @@
}, },
{ {
"cell_type": "code", "cell_type": "code",
"execution_count": 3, "execution_count": 2,
"metadata": { "metadata": {
"collapsed": false "collapsed": false
}, },
@@ -129,7 +135,7 @@
}, },
{ {
"cell_type": "code", "cell_type": "code",
"execution_count": 4, "execution_count": 3,
"metadata": { "metadata": {
"collapsed": false "collapsed": false
}, },
@@ -175,7 +181,7 @@
}, },
{ {
"cell_type": "code", "cell_type": "code",
"execution_count": 5, "execution_count": 4,
"metadata": { "metadata": {
"collapsed": false "collapsed": false
}, },