parameters: (self)
return_statement: return current.data
docstring: returns right-most item present in binary search tree which is also
              the maximum element in bst
docstring_summary: returns right-most item present in binary search tree which is also
              the maximum element in bst
docstring_tokens: returns right - most item present in binary search tree which is also the maximum element in bst
function: def max(self):
          """ returns right-most item present in binary search tree which is also
              the maximum element in bst
          """
          if self.root is None:
              raise Exception("tree is empty")
  
          current = self.root
          while current.right is not None:
              current = current.right
          return current.data
function_tokens: def max ( self ) : if self . root is None : raise Exception ( "tree is empty" ) current = self . root while current . right is not None : current = current . right return current . data