2015-08-01 21:26:03 +08:00
{
" cells " : [
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" <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 " : [
2016-06-25 20:26:19 +08:00
" ## Problem: Implement breadth-first traversal on a binary tree. \n " ,
2015-08-01 21:26:03 +08:00
" \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 " ,
" * Can we assume we already have a Node class with an insert method? \n " ,
2016-06-25 20:26:19 +08:00
" * Yes \n " ,
" * Can we assume this fits in memory? \n " ,
" * Yes \n " ,
" * What should we do with each node when we process it? \n " ,
" * Call an input method `visit_func` on the node "
2015-08-01 21:26:03 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Test Cases \n " ,
" \n " ,
2016-06-25 20:26:19 +08:00
" ### Breadth-First Traversal \n " ,
2015-08-01 21:26:03 +08:00
" * 5, 2, 8, 1, 3 -> 5, 2, 8, 1, 3 "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Algorithm \n " ,
" \n " ,
2015-08-01 21:41:28 +08:00
" Refer to the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/graphs_trees/tree_bfs/bfs_solution.ipynb). If you are stuck and need a hint, the solution notebook ' s algorithm discussion might be a good place to start. "
2015-08-01 21:26:03 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Code "
]
} ,
2015-08-02 05:48:12 +08:00
{
" cell_type " : " code " ,
" execution_count " : null ,
" metadata " : {
" collapsed " : true
} ,
" outputs " : [ ] ,
" source " : [
" %r un ../bst/bst.py \n " ,
" %lo ad ../bst/bst.py "
]
} ,
2015-08-01 21:26:03 +08:00
{
" cell_type " : " code " ,
" execution_count " : null ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [ ] ,
" source " : [
2015-08-02 05:48:12 +08:00
" def bfs(self, visit_func): \n " ,
2015-08-05 07:34:54 +08:00
" # TODO: Implement me \n " ,
" pass "
2015-08-01 21:26:03 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Unit Test "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : null ,
" metadata " : {
" collapsed " : true
} ,
" outputs " : [ ] ,
" source " : [
2015-08-05 07:34:54 +08:00
" %r un ../utils/results.py "
2015-08-01 21:26:03 +08:00
]
} ,
{
" cell_type " : " code " ,
" execution_count " : null ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [ ] ,
" source " : [
" # %lo ad test_bfs.py \n " ,
" from nose.tools import assert_equal \n " ,
" \n " ,
" \n " ,
" class TestBfs(object): \n " ,
" \n " ,
2015-08-05 07:34:54 +08:00
" def __init__(self): \n " ,
" self.results = Results() \n " ,
2015-08-01 21:26:03 +08:00
" \n " ,
2015-08-05 07:34:54 +08:00
" def test_bfs(self): \n " ,
" node = Node(5) \n " ,
" insert(node, 2) \n " ,
" insert(node, 8) \n " ,
" insert(node, 1) \n " ,
" insert(node, 3) \n " ,
" bfs(node, self.results.add_result) \n " ,
" assert_equal(str(self.results), ' [5, 2, 8, 1, 3] ' ) \n " ,
2015-08-01 21:26:03 +08:00
" \n " ,
" print( ' Success: test_bfs ' ) \n " ,
" \n " ,
" \n " ,
" def main(): \n " ,
" test = TestBfs() \n " ,
" test.test_bfs() \n " ,
" \n " ,
" \n " ,
" if __name__ == ' __main__ ' : \n " ,
" main() "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Solution Notebook \n " ,
" \n " ,
2015-08-01 21:41:28 +08:00
" Review the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/graphs_trees/tree_bfs/bfs_solution.ipynb) for a discussion on algorithms and code solutions. "
2015-08-01 21:26:03 +08:00
]
}
] ,
" metadata " : {
" kernelspec " : {
2016-06-25 20:26:19 +08:00
" display_name " : " Python 3 " ,
2015-08-01 21:26:03 +08:00
" language " : " python " ,
2016-06-25 20:26:19 +08:00
" name " : " python3 "
2015-08-01 21:26:03 +08:00
} ,
" language_info " : {
" codemirror_mode " : {
" name " : " ipython " ,
2016-06-25 20:26:19 +08:00
" version " : 3
2015-08-01 21:26:03 +08:00
} ,
" file_extension " : " .py " ,
" mimetype " : " text/x-python " ,
" name " : " python " ,
" nbconvert_exporter " : " python " ,
2016-06-25 20:26:19 +08:00
" pygments_lexer " : " ipython3 " ,
" version " : " 3.5.0 "
2015-08-01 21:26:03 +08:00
}
} ,
" nbformat " : 4 ,
" nbformat_minor " : 0
}