* Given a non - empty binary search tree , return the node with minimum key value * found in that tree . Note that the entire tree does not need to be searched .
function minValueNode ( node ) { var current = node ;