GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-08 10:28:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update bst insert to return the inserted node (#81)

Browse Source
This commit is contained in:
Donne Martin
2016-06-25 21:03:26 -04:00
committed by GitHub
parent 7882ed9ae7
commit 042161dc3b
4 changed files with 29 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
graphs_trees/bst/test_bst.py
View File

@@ -8,18 +8,18 @@ class TestTree(object):
def test_tree(self):
node = Node(5)
insert(node, 2)
insert(node, 8)
insert(node, 1)
insert(node, 3)
assert_equal(insert(node, 2).data, 2)
assert_equal(insert(node, 8).data, 8)
assert_equal(insert(node, 1).data, 1)
assert_equal(insert(node, 3).data, 3)
in_order_traversal(node, self.results.add_result)
assert_equal(str(self.results), '[1, 2, 3, 5, 8]')
self.results.clear_results()
node = insert(None, 1)
insert(node, 2)
insert(node, 3)
insert(node, 4)
assert_equal(insert(node, 2).data, 2)
assert_equal(insert(node, 3).data, 3)
assert_equal(insert(node, 4).data, 4)
insert(node, 5)
in_order_traversal(node, self.results.add_result)
assert_equal(str(self.results), '[1, 2, 3, 4, 5]')