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

Update bst challenge (#114)

Browse Source 
Update constraints and assumptions.
This commit is contained in:
Donne Martin
2016-11-07 05:05:26 -05:00
committed by GitHub
parent c6677586d3
commit 0098574a47
2 changed files with 0 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
graphs_trees/bst/bst_challenge.ipynb
View File

@@ -39,8 +39,6 @@
" * Yes\n", " * Yes\n",
"* Can we assume all left descendents <= n < all right descendents?\n", "* Can we assume all left descendents <= n < all right descendents?\n",
" * Yes\n", " * Yes\n",
"* For simplicity, can we use just a Node class without a wrapper Tree class?\n",
" * Yes\n",
"* Do we have to keep track of the parent nodes?\n", "* Do we have to keep track of the parent nodes?\n",
" * This is optional\n", " * This is optional\n",
"* Can we assume this fits in memory?\n", "* Can we assume this fits in memory?\n",

2
graphs_trees/bst/bst_solution.ipynb
View File

@@ -39,8 +39,6 @@
" * Yes\n", " * Yes\n",
"* Can we assume all left descendents <= n < all right descendents?\n", "* Can we assume all left descendents <= n < all right descendents?\n",
" * Yes\n", " * Yes\n",
"* For simplicity, can we use just a Node class without a wrapper Tree class?\n",
" * Yes\n",
"* Do we have to keep track of the parent nodes?\n", "* Do we have to keep track of the parent nodes?\n",
" * This is optional\n", " * This is optional\n",
"* Can we assume this fits in memory?\n", "* Can we assume this fits in memory?\n",