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 " : [
" # Solution 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) "
]
} ,
{
" 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 " ,
" The algorithm will be similar to where we get the height of a tree as seen in [here](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/graphs_trees/tree_height/height_solution.ipynb). \n " ,
" \n " ,
" However, we could check whether the tree is balanced while also checking for the heights. \n " ,
" \n " ,
" * Base case: If the root is None, return 0 \n " ,
2015-10-10 13:24:01 +08:00
" * Recursively check whether the left sub tree is balanced, and get its maximum and minimum height \n " ,
" * Recursively Check whether the right sub tree is balanced, and get its maximum and minimum height \n " ,
" * Calculate the maximum height and minimum height of the current tree \n " ,
" * If both sub-trees are balanced, and the maximum and minimum height of the current tree doesn ' t differ by more than 1, then the current tree is balanced. Otherwise, it is not \n " ,
" * Return whether the current tree is balanced, and the maximum height and minimum height of the current tree \n " ,
2015-08-06 18:09:30 +08:00
" \n " ,
" Complexity: \n " ,
" * Time: O(n) \n " ,
2015-08-13 18:51:53 +08:00
" * Space: O(h), where h is the height of the tree "
2015-08-06 18:09:30 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Code "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : 1 ,
" metadata " : {
" collapsed " : true
} ,
" outputs " : [ ] ,
" source " : [
" %r un ../bst/bst.py "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : 2 ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [ ] ,
" source " : [
2016-06-25 20:42:16 +08:00
" def _check_balance(root): \n " ,
2016-06-26 10:13:15 +08:00
" if root is None: \n " ,
2015-10-10 13:24:01 +08:00
" return (True, 0, 0) \n " ,
2016-06-25 20:42:16 +08:00
" left_balanced, left_min_h, left_max_h = _check_balance(root.left) \n " ,
" right_balanced, right_min_h, right_max_h = _check_balance(root.right) \n " ,
" min_h = 1 + min(left_min_h, right_min_h) \n " ,
" max_h = 1 + max(left_max_h, right_max_h) \n " ,
" balanced = left_balanced and right_balanced and abs(max_h-min_h) <= 1 \n " ,
2015-10-10 13:24:01 +08:00
" return (balanced, min_h, max_h) \n " ,
2015-08-06 18:09:30 +08:00
" \n " ,
2016-06-26 10:13:15 +08:00
" \n " ,
2015-10-10 13:24:01 +08:00
" def check_balance(root): \n " ,
2016-06-25 20:42:16 +08:00
" if root is None: \n " ,
2016-06-26 10:13:15 +08:00
" raise Exception( ' No root node ' ) \n " ,
2016-06-25 20:42:16 +08:00
" balanced, _, _ = _check_balance(root) \n " ,
2015-10-10 13:24:01 +08:00
" return balanced "
2015-08-06 18:09:30 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Unit Test "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : 3 ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [
{
" name " : " stdout " ,
" output_type " : " stream " ,
" text " : [
" Overwriting test_check_balance.py \n "
]
}
] ,
" source " : [
" %% writefile 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 " ,
" check_balance(None) \n " ,
2016-06-25 20:42:16 +08:00
" \n " ,
2016-06-26 10:13:15 +08:00
" def test_check_balance(self): \n " ,
2015-08-06 18:09:30 +08:00
" node = Node(5) \n " ,
2016-06-25 20:42:16 +08:00
" assert_equal(check_balance(node), True) \n " ,
" \n " ,
2015-08-06 18:09:30 +08:00
" insert(node, 3) \n " ,
" insert(node, 8) \n " ,
" insert(node, 1) \n " ,
" insert(node, 4) \n " ,
" assert_equal(check_balance(node), True) \n " ,
" \n " ,
" node = Node(5) \n " ,
" insert(node, 3) \n " ,
" insert(node, 8) \n " ,
" insert(node, 9) \n " ,
" insert(node, 10) \n " ,
" assert_equal(check_balance(node), False) \n " ,
2015-10-10 13:24:01 +08:00
" \n " ,
" node = Node(3) \n " ,
" insert(node, 2) \n " ,
" insert(node, 1) \n " ,
" insert(node, 5) \n " ,
" insert(node, 4) \n " ,
" insert(node, 6) \n " ,
" insert(node, 7) \n " ,
" assert_equal(check_balance(node), False) \n " ,
2015-08-06 18:09:30 +08:00
" \n " ,
" 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 " : " code " ,
" execution_count " : 4 ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [
{
" name " : " stdout " ,
" output_type " : " stream " ,
" text " : [
" Success: test_check_balance \n "
]
}
] ,
" source " : [
" %r un -i test_check_balance.py "
]
}
] ,
" 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
}