determine the average time to look up a key in a randomly generated balanced binary search tree in C#?
<p>I'm trying to determine the average amount of time it takes to loop up a key in a randomly generated balanced binary search tree, as a function of the size of the tree.. I'm unable to write the code to calculate the time.. so if i can get help or at least best way to write the code i would appreciate it... its been a while since i coded</p>
