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

Add bst second largest challenge

Browse Source
This commit is contained in:
Donne Martin
2017-03-30 05:41:29 -04:00
parent 3051c877e5
commit 6c507fc3ea
4 changed files with 519 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
graphs_trees/bst_second_largest/test_bst_second_largest.py Normal file
View File

@@ -0,0 +1,36 @@
from nose.tools import assert_equal, assert_raises
class TestBstSecondLargest(object):
def test_bst_second_largest(self):
bst = Solution(None)
assert_raises(TypeError, bst.find_second_largest)
root = Node(10)
bst = Solution(root)
node5 = bst.insert(5)
node15 = bst.insert(15)
node3 = bst.insert(3)
node8 = bst.insert(8)
node12 = bst.insert(12)
node20 = bst.insert(20)
node2 = bst.insert(2)
node4 = bst.insert(4)
node30 = bst.insert(30)
assert_equal(bst.find_second_largest(), node20)
root = Node(10)
bst = Solution(root)
node5 = bst.insert(5)
node3 = bst.insert(3)
node7 = bst.insert(7)
assert_equal(bst.find_second_largest(), node7)
print('Success: test_bst_second_largest')
def main():
test = TestBstSecondLargest()
test.test_bst_second_largest()
if __name__ == '__main__':
main()