Worst case scenario in binary search tree retrieval Well, i have a binary search tree $T$ that is equilibrated by height witch has $2^d+c$ nodes ($c&lt;2^d$). 
What is the number of comparisons that will occur in the worst case scenario, if we ask whether $k\in V(T)$ and why does it arise?
Hint: If the tree has height $h$ then the worst number of comparisons is ...? If the tree is "equilibrated by height" (I guess balanced) and has $n$ nodes then its height is ...?