mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-05 00:48:03 +00:00
45 lines
1.2 KiB
Python
45 lines
1.2 KiB
Python
from nose.tools import assert_equal
|
|
from nose.tools import raises
|
|
|
|
|
|
class TestBstSuccessor(object):
|
|
|
|
@raises(Exception)
|
|
def test_bst_successor_empty(self):
|
|
bst_successor = BstSuccessor()
|
|
bst_successor.get_next(None)
|
|
|
|
def test_bst_successor(self):
|
|
nodes = {}
|
|
node = Node(5)
|
|
nodes[5] = node
|
|
bst = Bst(nodes[5])
|
|
nodes[3] = bst.insert(3)
|
|
nodes[8] = bst.insert(8)
|
|
nodes[2] = bst.insert(2)
|
|
nodes[4] = bst.insert(4)
|
|
nodes[6] = bst.insert(6)
|
|
nodes[12] = bst.insert(12)
|
|
nodes[1] = bst.insert(1)
|
|
nodes[7] = bst.insert(7)
|
|
nodes[10] = bst.insert(10)
|
|
nodes[15] = bst.insert(15)
|
|
nodes[9] = bst.insert(9)
|
|
|
|
bst_successor = BstSuccessor()
|
|
assert_equal(bst_successor.get_next(nodes[4]), 5)
|
|
assert_equal(bst_successor.get_next(nodes[5]), 6)
|
|
assert_equal(bst_successor.get_next(nodes[8]), 9)
|
|
assert_equal(bst_successor.get_next(nodes[15]), None)
|
|
|
|
print('Success: test_bst_successor')
|
|
|
|
|
|
def main():
|
|
test = TestBstSuccessor()
|
|
test.test_bst_successor()
|
|
test.test_bst_successor_empty()
|
|
|
|
|
|
if __name__ == '__main__':
|
|
main() |