2015-08-15 07:30:09 +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-15 07:30:09 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" # Challenge Notebook "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Problem: Determine if a tree is a valid binary search tree. \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 " ,
" * Can the tree have duplicates? \n " ,
" * Yes \n " ,
2016-06-26 10:08:54 +08:00
" * If this is called on a None input, should we raise an exception? \n " ,
" * Yes \n " ,
2015-08-15 07:30:09 +08:00
" * Can we assume we already have a Node class? \n " ,
2016-06-26 10:08:54 +08:00
" * Yes \n " ,
" * Can we assume this fits in memory? \n " ,
2015-08-15 07:30:09 +08:00
" * Yes "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Test Cases \n " ,
" \n " ,
" <pre> \n " ,
" Valid: \n " ,
" 5 \n " ,
" / \\ \n " ,
" 5 8 \n " ,
2017-06-06 08:27:49 +08:00
" / / \n " ,
" 4 6 \n " ,
" \\ \n " ,
" 7 \n " ,
" \n " ,
2015-08-15 07:30:09 +08:00
" Invalid: \n " ,
" 5 \n " ,
" / \\ \n " ,
" 5 8 \n " ,
" / \\ / \n " ,
" 4 9 7 \n " ,
" </pre> "
]
} ,
{
" 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_validate/bst_validate_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 ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [ ] ,
" source " : [
2016-08-30 18:06:58 +08:00
" class BstValidate(Bst): \n " ,
" \n " ,
" def validate(self): \n " ,
" # TODO: Implement me \n " ,
" pass "
2015-08-15 07:30:09 +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 ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [ ] ,
" source " : [
" # %lo ad test_bst_validate.py \n " ,
" from nose.tools import assert_equal \n " ,
2016-06-26 10:08:54 +08:00
" from nose.tools import raises \n " ,
2015-08-15 07:30:09 +08:00
" \n " ,
" \n " ,
" class TestBstValidate(object): \n " ,
" \n " ,
2016-06-26 10:08:54 +08:00
" @raises(Exception) \n " ,
" def test_bst_validate_empty(self): \n " ,
" validate_bst(None) \n " ,
" \n " ,
2015-08-15 07:30:09 +08:00
" def test_bst_validate(self): \n " ,
2016-08-30 18:06:58 +08:00
" bst = BstValidate(Node(5)) \n " ,
" bst.insert(8) \n " ,
" bst.insert(5) \n " ,
" bst.insert(6) \n " ,
" bst.insert(4) \n " ,
" bst.insert(7) \n " ,
" assert_equal(bst.validate(), True) \n " ,
2015-08-15 07:30:09 +08:00
" \n " ,
2016-08-30 18:06:58 +08:00
" bst = BstValidate(Node(5)) \n " ,
2015-08-15 07:30:09 +08:00
" left = Node(5) \n " ,
" right = Node(8) \n " ,
" invalid = Node(20) \n " ,
2016-08-30 18:06:58 +08:00
" bst.root.left = left \n " ,
" bst.root.right = right \n " ,
" bst.root.left.right = invalid \n " ,
" assert_equal(bst.validate(), False) \n " ,
2016-06-26 10:08:54 +08:00
" \n " ,
2015-08-15 07:30:09 +08:00
" print( ' Success: test_bst_validate ' ) \n " ,
" \n " ,
" \n " ,
" def main(): \n " ,
" test = TestBstValidate() \n " ,
2016-06-26 10:08:54 +08:00
" test.test_bst_validate_empty() \n " ,
2015-08-15 07:30:09 +08:00
" test.test_bst_validate() \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_validate/bst_validate_solution.ipynb) for a discussion on algorithms and code solutions. "
]
}
] ,
" metadata " : {
" kernelspec " : {
2016-06-26 10:08:54 +08:00
" display_name " : " Python 3 " ,
2015-08-15 07:30:09 +08:00
" language " : " python " ,
2016-06-26 10:08:54 +08:00
" name " : " python3 "
2015-08-15 07:30:09 +08:00
} ,
" language_info " : {
" codemirror_mode " : {
" name " : " ipython " ,
2016-06-26 10:08:54 +08:00
" version " : 3
2015-08-15 07:30:09 +08:00
} ,
" file_extension " : " .py " ,
" mimetype " : " text/x-python " ,
" name " : " python " ,
" nbconvert_exporter " : " python " ,
2016-06-26 10:08:54 +08:00
" pygments_lexer " : " ipython3 " ,
" version " : " 3.5.0 "
2015-08-15 07:30:09 +08:00
}
} ,
" nbformat " : 4 ,
" nbformat_minor " : 0
}