Python 3 constructors for this problem:

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)])])])) #** YOUR CODE GOES HERE ** 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)])])])) #** YOUR CODE GOES HERE **