The algorithmic problem Range

Consider the algorithmic problem Range de fined as follows:
Input: a, possibly NULL, node x in a binary search tree; two key values a,b with a less or egual to b;
Output: the sequence of entries in the binary search tree with root x whose key values are in the range [a..b].
Give a recursive algorithm to solve the above problem.
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

It's really easy. It's supposed to be recursive and you know in a binary search tree that every node less than the root is on the left of the root and every node greater is on the right side.
So all you need to do is look at x and see where it falls in the range. Then just recurse the tree from x putting all the values in the range out as output.

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today

From novice to tech pro — start learning today.

Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.