input: Write a python function to find the maximum value in a binary search tree.
  assert findMaxValue(root) == 5
  root.right.right = Node(7)
  assert findMaxValue(root) == 7
  root.right.right.right = Node(10)
  assert findMaxValue(root) == 10
output: def findMaxValue(root):
      current = root
      while current.right:
          current = current.right
      return current.data
  
  class Node:
      def __init__(self, data):
          self.data = data
          self.left = None
          self.right = None
  
  # Example usage:
  root = Node(3)
  root.left = Node(2)
  root.right = Node(5)