def findBiggest(root):
 if (root.right is None):
  return root
 else:
  return findBiggest(root.right)

def findBiggest ( root ) : if ( root . right is None ) : return root else : return findBiggest ( root . right )
finds the largest node in the tree .