This notebook was prepared by Donne Martin. Source and license info is on GitHub.
We'll use a recursive algorithm.
Complexity:
%run ../bst/bst.py
class BstHeight(Bst):
def height(self, node):
if node is None:
return 0
return 1 + max(self.height(node.left),
self.height(node.right))
%%writefile test_height.py
import unittest
class TestHeight(unittest.TestCase):
def test_height(self):
bst = BstHeight(Node(5))
self.assertEqual(bst.height(bst.root), 1)
bst.insert(2)
bst.insert(8)
bst.insert(1)
bst.insert(3)
self.assertEqual(bst.height(bst.root), 3)
print('Success: test_height')
def main():
test = TestHeight()
test.test_height()
if __name__ == '__main__':
main()
Overwriting test_height.py
%run -i test_height.py
Success: test_height