Given a non - empty binary search tree , return the minimum data value found in that tree . Note that the entire tree doesn 't need to be searched
def minValue ( node ) : NEW_LINE INDENT current = node NEW_LINE DEDENT