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?

>>40
Unaligned data access
Ｉ ｆｅｅｌ ｋｉｎｄ ｏｆ ｂａｄ ａｂｏｕｔ ｉｔ ：（

-funroll loops is just kids having fun rolling down a hill FOREVER

44 Name: Anonymous 2011-02-18 13:17

dubz

45 Name: Anonymous 2014-01-21 21:02

>>44
>le pedophile sage

---

Newer Posts

---

Don't change these.

Name:		Email:
Entire Thread Thread List