"<small><i>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).</i></small>"
]
},
{
"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",
"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":[
"%run ../bst/bst.py\n",
"%load ../bst/bst.py"
]
},
{
"cell_type":"code",
"execution_count":null,
"metadata":{
"collapsed":false
},
"outputs":[],
"source":[
"def check_balance(root):\n",
" # TODO: Implement me\n",
" pass"
]
},
{
"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.**"
"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."