Python 3

I want to find the maximum value in a tree, the leaf of a tree doesn't count but can use the label(root). please use these abstractions: So the max is 3 in this case:

Question 7: Max value in a tree, but not a leaf Write a recursive function, max_node, which takes a tree t and returns largest inner node value. You can assume that a given tree will have at least two nodes def max_node_not_leaf (t): ""Retuns the maximum value of the inner nodes (not leaves) >max_node_not_leaf (tree(1, tree(5)])) max_node_not leaf(tree(1, (tree(8), tree(2, tree(4, tree(8)))])) HERE #** YOUR CODE GOES HERE *