title: Non recursive floor method for Binary search tree
body: <p>I have been trying to get this to work but while it works for majority of the input sometimes it gives the wrong output. I have spent some time debugging the code and it seems the problem is when i get a Node that is smaller than the root but bigger than the left node under the root. </p>
  
  <p>How can I traverse the right sub-tree and still return the right key if no node in the right sub-tree is the floor node for that key?</p>