This question is about Maps (Trees & Hash table) for Python. Please include the answer with explanation. Also, a screenshot in IDLE would be appreciated.

Given the following Python class definition for a Node object in a Binary Search Tree, come up with a method that returns the height (number of edges from root to furthest leaf) of the tree in which it is the root. The function may be recursive (and may be much simpler to write).

class Node: def __init__(self, key, value):  self.key = key self.value = value self.left = None self.right = None