I had sent in my resume and then talked with a recruiter who set up a technical phone interview for me. The technical interview began with an algorithm question. Then, we moved on to discuss an architectural problem. A few days later, the recruiter contacted me with the news: I had been rejected after the first phone screen. They said I could reapply in a few months.

How do we find all the numbers between A and B in a binary search tree?