Consider the code below which implements class BST that models a binary search tree $($similar to the code presented in your textbook, with some methods removed for the sake of saving space$).$

Define a method of class BST that returns the smallest element in an instance of class BST$.$

Note: $(1)$ You may define additional helper methods as needed, $(2)$ You may use $4-$spaces for each tab.