Range query over binary search tree?

Okay, so does anyone know or can think of an efficient way to complete a range query over a given number range ie (x, y) in a standard binary search tree, using a minimum number of key comparisons? I wrote one that finds the minimum value <= x and then traverses the tree value by value until it finds a value that is above y, but I just realised that it would be a lot more efficient if it was recursive, and did not provide the range query's response in a sorted order.

Unfortunately, I have writer's block. Still getting used to getting my head in algorithm-space. Can anyone give me some pointers to get me started?

>>35
if there's a syntax error it's not going to really do anything at all after that except print out potentially misleading error messages as it tries to incorrectly parse the rest of the code.
When was the last time you tried to compile source with a few typos in it? 1978? Most modern parsers are very good at recovering from syntax errors.
Even as early as 1978, though, most parsers bailed out after a certain number of errors to prevent flooding the terminal.

you can't recompile something that you haven't compiled yet.
Attempt to recompile, then. Worthless pedant.