Give nonrecursive implementations of floorI method for BST i

Give non-recursive implementations of floorI(…) method for BST in java.

private Node floorI(Node node, Key key){

Solution

Hi, Please let me know in case of any issue.

private Node floorI(Node node, Key key)
{
if(node == null)
return -1; //tree is null
  
Node temp = node;
int diff = Integer.INT_MAX;
int floor = -1;
while(temp != null) {

   if(temp.key == key){
       floor = temp.key;
       break;
   }
   else if(temp.key < key) {
       int t = temp.key - key;
       if(diff > t) {
           floor = temp.key;
           diff = t;
           temp= temp.right;
       }
   }
   else if(temp.key > key) {
       temp = temp.left;
   }
}
return floor;
}