I need to find an algorithm that runs a search in a rundomly made binary tree that holds the keys 1 to n and looks for a subdomain..let's say I'm looking for nodes between the keys 4-30.
I can't find any example codes on the web or explanations..even in Corman's book!! :S
I need to find the number of nodes the algorithm goes through in the worst, average and best case performance.
I'm really a beginner in all of this and COMPLETLY lost, can someone please help me understand what to do and where to even start?