mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-03 16:08:02 +00:00
37 lines
962 B
Python
37 lines
962 B
Python
import unittest
|
|
|
|
|
|
class TestBstSecondLargest(unittest.TestCase):
|
|
|
|
def test_bst_second_largest(self):
|
|
bst = Solution(None)
|
|
self.assertRaises(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)
|
|
self.assertEqual(bst.find_second_largest(), node20)
|
|
root = Node(10)
|
|
bst = Solution(root)
|
|
node5 = bst.insert(5)
|
|
node3 = bst.insert(3)
|
|
node7 = bst.insert(7)
|
|
self.assertEqual(bst.find_second_largest(), node7)
|
|
print('Success: test_bst_second_largest')
|
|
|
|
|
|
def main():
|
|
test = TestBstSecondLargest()
|
|
test.test_bst_second_largest()
|
|
|
|
|
|
if __name__ == '__main__':
|
|
main()
|