Fool proof way to find is, to perform 2 binary searches, one for n-1 and other for n+1.
Even if n-1 and n+1 are not present, we can modify BST to return the index where min,max are equal.
Then check the difference between two resuls, if greater than n/2.
Hence 2logn comparisons required and answer is B.