This notebook was prepared by Donne Martin. Source and license info is on GitHub.

# Challenge Notebook¶

## Constraints¶

• Is this a binary tree?
• Yes
• Can we assume we already have a Node class with an insert method?
• Yes
• Can we assume this fits memory?
• Yes

## Test Cases¶

• 5 -> 1
• 5, 2, 8, 1, 3 -> 3

## Algorithm¶

Refer to the Solution Notebook. If you are stuck and need a hint, the solution notebook's algorithm discussion might be a good place to start.

## Code¶

In [ ]:
%run ../bst/bst.py

In [ ]:
class BstHeight(Bst):

def height(self, node):
# TODO: Implement me
pass


## Unit Test¶

The following unit test is expected to fail until you solve the challenge.

In [ ]:
# %load 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()


## Solution Notebook¶

Review the Solution Notebook for a discussion on algorithms and code solutions.