Greetings, I believe I have solved this problem. I have tested my solution elsewhere and it works fine, but for some reason the following two tests aren’t passing on FCC:

The findMin method should return the minimum value in the binary search tree.

The findMax method should return the maximum value in the binary search tree.
Link to the challenge: https://www.freecodecamp.org/learn/codinginterviewprep/datastructures/findtheminimumandmaximumvalueinabinarysearchtree
Here is my code:
// Only change code below this line
this.findMin = function(){
if(this.root === null){
return null;
} else {
let current = this.root;
let moveLeft = function(){
if(current.left !== null){
current = current.left;
moveLeft();
} else if(current.left === null){
return current.value;
}
}
moveLeft();
}
}
this.findMax = function(){
if(this.root === null){
return null;
} else {
let current = this.root;
let moveRight = function(){
if(current.right !== null){
current = current.right;
moveRight();
} else if (current.right === null){
return current.value;
}
}
moveRight();
}
}
// Only change code above this line
Am I missing something? Thank you.