Design an algorithm in Python to find the maximum value in a binary tree.
Not applicable
def max_in_tree(node):
    if node is None:
        return -float('inf')
    left_max = max_in_tree(node.left)
    right_max = max_in_tree(node.right)
    return max(node.value, left_max, right_max)