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

Polish tree level lists challenge and solution (#79)

Browse Source 
Update constraints and test cases.
This commit is contained in:
Donne Martin
2016-06-25 08:37:39 -04:00
committed by GitHub
parent 884bbe4870
commit 996058195d
2 changed files with 24 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
graphs_trees/tree_level_lists/tree_level_lists_challenge.ipynb
View File

@@ -36,7 +36,11 @@
"\n",
"* Is this a binary search tree?\n",
" * Yes\n",
"* Should each level be a list of nodes?\n",
" * Yes\n",
"* Can we assume we already have a Node class with an insert method?\n",
" * Yes\n",
"* Can we assume this fits memory?\n",
" * Yes"
]
},
@@ -46,7 +50,9 @@
"source": [
"## Test Cases\n",
"\n",
"* 5, 3, 8, 2, 4, 1, 7, 6, 9, 10, 11 -> [[5], [3, 8], [2, 4, 7, 9], [1, 6, 10], [11]]"
"* 5, 3, 8, 2, 4, 1, 7, 6, 9, 10, 11 -> [[5], [3, 8], [2, 4, 7, 9], [1, 6, 10], [11]]\n",
"\n",
"Note: Each number in the result is actually a node containing the number"
]
},
{
@@ -180,21 +186,21 @@
],
"metadata": {
"kernelspec": {
"display_name": "Python 2",
"display_name": "Python 3",
"language": "python",
"name": "python2"
"name": "python3"
},
"language_info": {
"codemirror_mode": {
"name": "ipython",
"version": 2
"version": 3
},
"file_extension": ".py",
"mimetype": "text/x-python",
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython2",
"version": "2.7.10"
"pygments_lexer": "ipython3",
"version": "3.5.0"
}
},
"nbformat": 4,

18
graphs_trees/tree_level_lists/tree_level_lists_solution.ipynb
View File

@@ -35,7 +35,11 @@
"\n",
"* Is this a binary search tree?\n",
" * Yes\n",
"* Should each level be a list of nodes?\n",
" * Yes\n",
"* Can we assume we already have a Node class with an insert method?\n",
" * Yes\n",
"* Can we assume this fits memory?\n",
" * Yes"
]
},
@@ -45,7 +49,9 @@
"source": [
"## Test Cases\n",
"\n",
"* 5, 3, 8, 2, 4, 1, 7, 6, 9, 10, 11 -> [[5], [3, 8], [2, 4, 7, 9], [1, 6, 10], [11]]"
"* 5, 3, 8, 2, 4, 1, 7, 6, 9, 10, 11 -> [[5], [3, 8], [2, 4, 7, 9], [1, 6, 10], [11]]\n",
"\n",
"Note: Each number in the result is actually a node containing the number"
]
},
{
@@ -217,21 +223,21 @@
],
"metadata": {
"kernelspec": {
"display_name": "Python 2",
"display_name": "Python 3",
"language": "python",
"name": "python2"
"name": "python3"
},
"language_info": {
"codemirror_mode": {
"name": "ipython",
"version": 2
"version": 3
},
"file_extension": ".py",
"mimetype": "text/x-python",
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython2",
"version": "2.7.10"
"pygments_lexer": "ipython3",
"version": "3.5.0"
}
},
"nbformat": 4,