GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-10 03:18: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": [],
"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",
" def bfs(self, visit_func):\n",
" # TODO: Implement me"