2015-08-06 18:09:30 +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 18:09:30 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" # Challenge Notebook "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Problem: Check if a binary tree is balanced. \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 a balanced tree one where the heights of two sub trees of any node doesn ' t differ by more than 1? \n " ,
" * Yes \n " ,
2016-06-26 10:13:15 +08:00
" * If this is called on a None input, should we raise an exception? \n " ,
2016-06-25 20:42:16 +08:00
" * Yes \n " ,
2015-08-06 18:09:30 +08:00
" * Can we assume we already have a Node class with an insert method? \n " ,
2016-06-25 20:42:16 +08:00
" * Yes \n " ,
" * Can we assume this fits memory? \n " ,
2015-08-06 18:09:30 +08:00
" * Yes "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Test Cases \n " ,
" \n " ,
2016-06-25 20:42:16 +08:00
" * None -> No \n " ,
" * 1 -> Yes \n " ,
2015-08-06 18:09:30 +08:00
" * 5, 3, 8, 1, 4 -> Yes \n " ,
" * 5, 3, 8, 9, 10 -> No "
]
} ,
{
" 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/check_balance/check_balance_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-09-07 17:46:47 +08:00
" class BstBalance(Bst): \n " ,
" \n " ,
" def check_balance(self): \n " ,
" # TODO: Implement me \n " ,
" pass "
2015-08-06 18:09:30 +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_check_balance.py \n " ,
" from nose.tools import assert_equal \n " ,
2016-06-26 10:13:15 +08:00
" from nose.tools import raises \n " ,
2015-08-06 18:09:30 +08:00
" \n " ,
" \n " ,
" class TestCheckBalance(object): \n " ,
" \n " ,
2016-06-26 10:13:15 +08:00
" @raises(Exception) \n " ,
" def test_check_balance_empty(self): \n " ,
2016-09-07 17:46:47 +08:00
" bst = BstBalance(None) \n " ,
" bst.check_balance() \n " ,
2016-06-25 20:42:16 +08:00
" \n " ,
2016-06-26 10:13:15 +08:00
" def test_check_balance(self): \n " ,
2016-09-07 17:46:47 +08:00
" bst = BstBalance(Node(5)) \n " ,
" assert_equal(bst.check_balance(), True) \n " ,
2016-06-25 20:42:16 +08:00
" \n " ,
2016-09-07 17:46:47 +08:00
" bst.insert(3) \n " ,
" bst.insert(8) \n " ,
" bst.insert(1) \n " ,
" bst.insert(4) \n " ,
" assert_equal(bst.check_balance(), True) \n " ,
2015-08-06 18:09:30 +08:00
" \n " ,
2016-09-07 17:46:47 +08:00
" bst = BstBalance(Node(5)) \n " ,
" bst.insert(3) \n " ,
" bst.insert(8) \n " ,
" bst.insert(9) \n " ,
" bst.insert(10) \n " ,
" assert_equal(bst.check_balance(), False) \n " ,
2015-08-06 18:09:30 +08:00
" \n " ,
2016-09-07 17:46:47 +08:00
" bst = BstBalance(Node(3)) \n " ,
" bst.insert(2) \n " ,
" bst.insert(1) \n " ,
" bst.insert(5) \n " ,
" bst.insert(4) \n " ,
" bst.insert(6) \n " ,
" bst.insert(7) \n " ,
" assert_equal(bst.check_balance(), True) \n " ,
2016-06-25 20:42:16 +08:00
" \n " ,
2015-08-06 18:09:30 +08:00
" print( ' Success: test_check_balance ' ) \n " ,
" \n " ,
" \n " ,
" def main(): \n " ,
" test = TestCheckBalance() \n " ,
2016-06-26 10:13:15 +08:00
" test.test_check_balance_empty() \n " ,
2015-08-06 18:09:30 +08:00
" test.test_check_balance() \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/check_balance/check_balance_solution.ipynb) for a discussion on algorithms and code solutions. "
]
}
] ,
" metadata " : {
" kernelspec " : {
2016-06-25 20:42:16 +08:00
" display_name " : " Python 3 " ,
2015-08-06 18:09:30 +08:00
" language " : " python " ,
2016-06-25 20:42:16 +08:00
" name " : " python3 "
2015-08-06 18:09:30 +08:00
} ,
" language_info " : {
" codemirror_mode " : {
" name " : " ipython " ,
2016-06-25 20:42:16 +08:00
" version " : 3
2015-08-06 18:09:30 +08:00
} ,
" file_extension " : " .py " ,
" mimetype " : " text/x-python " ,
" name " : " python " ,
" nbconvert_exporter " : " python " ,
2016-06-25 20:42:16 +08:00
" pygments_lexer " : " ipython3 " ,
" version " : " 3.5.0 "
2015-08-06 18:09:30 +08:00
}
} ,
" nbformat " : 4 ,
" nbformat_minor " : 0
}