interactive-coding-challenges/graphs_trees
2016-06-25 21:03:26 -04:00
..
bst Update bst insert to return the inserted node (#81) 2016-06-25 21:03:26 -04:00
bst_min Polish bst min challenge and solution (#76) 2016-06-25 08:23:28 -04:00
bst_successor Add bst successor challenge. 2015-12-02 07:14:34 -05:00
bst_validate Added bst validate challenge. 2015-08-14 19:30:09 -04:00
check_balance Polish check tree balance challenge and solution (#80) 2016-06-25 08:42:16 -04:00
graph Added three state variable visit_state which will be useful for more advanced challenges such as topological sort. 2015-08-23 08:08:46 -04:00
graph_bfs Fixed issues with node state. 2016-05-08 11:22:47 -07:00
graph_dfs Fixed issues with node state. 2016-05-08 11:22:47 -07:00
graph_path_exists Fixed issues with node state. 2016-05-08 11:22:47 -07:00
templates Update template notebook headers to render properly on nbviewer, update author link. 2015-12-11 05:19:33 -05:00
tree_bfs Polish tree bfs challenge and solution (#77) 2016-06-25 08:26:19 -04:00
tree_dfs Polish tree dfs challenge and solution (#78) 2016-06-25 08:30:02 -04:00
tree_height Fixed Big O space complexity. 2015-08-13 06:52:32 -04:00
tree_level_lists Polish tree level lists challenge and solution (#79) 2016-06-25 08:37:39 -04:00
utils Simplified challenge coding and unit tests by working with the node directly as opposed to node.id or node.data, which is more natural when writing coding challenges. 2015-08-05 06:14:44 -04:00
__init__.py binary search tree implementation 2015-07-18 00:40:13 -05:00