Where is the maximum data element in a BST? the minimum data element?

These methods can easily be implemented either recursively or iteratively (using a loop) to move from the root to the largest (respectively, smallest) data element in the BST.