2015-08-06 06:16:26 +08:00
{
" cells " : [
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
2016-07-31 20:11:18 +08:00
" This notebook was prepared by [Donne Martin](https://github.com/donnemartin). Source and license info is on [GitHub](https://github.com/donnemartin/interactive-coding-challenges). "
2015-08-06 06:16:26 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" # Challenge Notebook "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Problem: Create a binary search tree with minimal height from a sorted array. \n " ,
" \n " ,
" * [Constraints](#Constraints) \n " ,
" * [Test Cases](#Test-Cases) \n " ,
" * [Algorithm](#Algorithm) \n " ,
" * [Code](#Code) \n " ,
" * [Unit Test](#Unit-Test) \n " ,
" * [Solution Notebook](#Solution-Notebook) "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Constraints \n " ,
" \n " ,
" * Is the array in increasing order? \n " ,
" * Yes \n " ,
" * Are the array elements unique? \n " ,
" * Yes \n " ,
" * Can we assume we already have a Node class with an insert method? \n " ,
2016-06-25 20:23:28 +08:00
" * Yes \n " ,
" * Can we assume this fits memory? \n " ,
2015-08-06 06:16:26 +08:00
" * Yes "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Test Cases \n " ,
" \n " ,
" * 0, 1, 2, 3, 4, 5, 6 -> height 3 \n " ,
" * 0, 1, 2, 3, 4, 5, 6, 7 -> height 4 "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Algorithm \n " ,
" \n " ,
" Refer to the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/graphs_trees/bst_min/bst_min_solution.ipynb). If you are stuck and need a hint, the solution notebook ' s algorithm discussion might be a good place to start. "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Code "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : null ,
" metadata " : {
" collapsed " : true
} ,
" outputs " : [ ] ,
" source " : [
" %r un ../bst/bst.py \n " ,
" %lo ad ../bst/bst.py "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : null ,
2020-07-11 09:02:32 +08:00
" metadata " : { } ,
2015-08-06 06:16:26 +08:00
" outputs " : [ ] ,
" source " : [
2016-08-14 20:22:07 +08:00
" class MinBst(object): \n " ,
2015-08-06 06:16:26 +08:00
" \n " ,
2016-08-14 20:22:07 +08:00
" def create_min_bst(self, array): \n " ,
" # TODO: Implement me "
2015-08-06 06:16:26 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Unit Test "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" **The following unit test is expected to fail until you solve the challenge.** "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : null ,
2020-07-11 09:02:32 +08:00
" metadata " : { } ,
2015-08-06 06:16:26 +08:00
" outputs " : [ ] ,
" source " : [
" # %lo ad test_bst_min.py \n " ,
2020-07-11 09:02:32 +08:00
" import unittest \n " ,
2015-08-06 06:16:26 +08:00
" \n " ,
" \n " ,
2016-08-14 20:22:07 +08:00
" def height(node): \n " ,
" if node is None: \n " ,
" return 0 \n " ,
" return 1 + max(height(node.left), \n " ,
" height(node.right)) \n " ,
" \n " ,
" \n " ,
2020-07-11 09:02:32 +08:00
" class TestBstMin(unittest.TestCase): \n " ,
2015-08-06 06:16:26 +08:00
" \n " ,
" def test_bst_min(self): \n " ,
2016-08-14 20:22:07 +08:00
" min_bst = MinBst() \n " ,
2015-08-06 06:16:26 +08:00
" array = [0, 1, 2, 3, 4, 5, 6] \n " ,
2016-08-14 20:22:07 +08:00
" root = min_bst.create_min_bst(array) \n " ,
2020-07-11 09:02:32 +08:00
" self.assertEqual(height(root), 3) \n " ,
2015-08-06 06:16:26 +08:00
" \n " ,
2016-08-14 20:22:07 +08:00
" min_bst = MinBst() \n " ,
2015-08-06 06:16:26 +08:00
" array = [0, 1, 2, 3, 4, 5, 6, 7] \n " ,
2016-08-14 20:22:07 +08:00
" root = min_bst.create_min_bst(array) \n " ,
2020-07-11 09:02:32 +08:00
" self.assertEqual(height(root), 4) \n " ,
2015-08-06 06:16:26 +08:00
" \n " ,
" print( ' Success: test_bst_min ' ) \n " ,
" \n " ,
" \n " ,
" def main(): \n " ,
" test = TestBstMin() \n " ,
" test.test_bst_min() \n " ,
" \n " ,
" \n " ,
" if __name__ == ' __main__ ' : \n " ,
" main() "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Solution Notebook \n " ,
" \n " ,
" Review the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/graphs_trees/bst_min/bst_min_solution.ipynb) for a discussion on algorithms and code solutions. "
]
}
] ,
" metadata " : {
" kernelspec " : {
2016-06-25 20:23:28 +08:00
" display_name " : " Python 3 " ,
2015-08-06 06:16:26 +08:00
" language " : " python " ,
2016-06-25 20:23:28 +08:00
" name " : " python3 "
2015-08-06 06:16:26 +08:00
} ,
" language_info " : {
" codemirror_mode " : {
" name " : " ipython " ,
2016-06-25 20:23:28 +08:00
" version " : 3
2015-08-06 06:16:26 +08:00
} ,
" file_extension " : " .py " ,
" mimetype " : " text/x-python " ,
" name " : " python " ,
" nbconvert_exporter " : " python " ,
2016-06-25 20:23:28 +08:00
" pygments_lexer " : " ipython3 " ,
2020-07-11 09:02:32 +08:00
" version " : " 3.7.2 "
2015-08-06 06:16:26 +08:00
}
} ,
" nbformat " : 4 ,
2020-07-11 09:02:32 +08:00
" nbformat_minor " : 1
2015-08-06 06:16:26 +08:00
}