In Python,

Binary Class: https://pastebin.com/muMtz9PJ

This question uses the same BinaryTree class as the previous questions. You can assume this class is available to you The depth of a binary tree can be computed as the longest path from any leaf node to the root. For example, consider this binary tree: HI KL The depth of this binary tree is 3. The red arrows show one path from a leaf node to the root, and this is the longest such path in the tree. Define a function called tree_depth0 which is passed a binary tree as input, and which calculates and returns the depth of the tree. In this case, if you know the depth of the left sub-tree, and you know the depth of the right sub-tree, how will you solve the problem? Well, the overall depth of the tree will be one more than the maximum of the depth of the left sub-tree and the depth of the right sub-tree. HINT: Think carefully about the base case. If you consider (tree None) as the only base case, you may find your function returns a value that is one bigger than it should be. A leaf node should also be a base case (a node on it's own has a depth of 0) For example: Test Result a -BinaryTree(100) print tree_depth(a))