Problem

Complete the function treeMax() to take in a root node of a binary tree and return the maximum value stored in the tree. Note that this is not a Binary Search Tree, so you cannot simply go all the way to the right of the tree to find the maximum.

complete #TODO

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

def treeMax(root): # TODO

1 class Node: 2. def-init--(self, value): Problem self.value value self.left None self.right None Complete the function treeMax() to take in a root node of a binary tree and return the maximum value stored in the tree. Note that this is not a Binary Search Tree, so you cannot simply go all the way to the right of the tree to find the maximum 4 6 7 def treeMax(root): 8#TODO