def helper(current):
"""
Helper function to use in recurtion to add new values in the new_tree according to their positions in the original tree
"""
node = Node(fizz_buzz(current.value))
if current.left:
node.left = helper(current.left)
if current.right:
node.right = helper(current.right)
return node
def _walk(current):
node = Node(comapre(current.value))
if current.left: node.left = _walk(current.left)
if current.right: node.right = _walk(current.right)
return node
from data_structures_and_algorithms.data_structures.tree.tree import Node, BinaryTree
def find_maximum_value(root):
if root == None:
return float('-inf')
res = root.value
lres = find_maximum_value(root.left)
rres = find_maximum_value(root.right)
if (lres > res):
res = lres
if (rres > res):
res = rres
return res
if __name__ == '__main__':
root = Node(7)
root.left = Node(7)
root.right = Node(5)
root.left.left = Node(2)
root.left.right = Node(6)
root.left.right.left = Node(5)
root.left.right.right = Node(11)
root.right.right = Node(9)
root.right.right.left = Node(4)
print("Maximum element is", find_maximum_value(root))