The apparent code ("pseudocode") of the recursive function that finds the smallest element in a binary search tree is given below. Break the recursive nature of this function and write a new function that performs the same operation with the help of a loop.

BinaryNode findMin(BinaryNode t) { if (t == null) return null; else if (t.left == null) return t; else return findMin(t.left); }