CareerCup

This is vague question. Besides the key, can we store nodes count in the tree nodes? If no more facilitation provided, no way to figure out the median in O(logn) IMHO.

question is not clear.
Anonymous please explain the question clearly with an example else don't put such junks.

As hunt said, we need to store count in nodes for O(logn) complexity.

This is perhaps not a vague question afterall... Its beauty is in its shortness.
Here's what I'd say, hopefully correct:

a = extract_min ( BST );
b = extract_max ( BST );
print "Median = ", sqrt(a*a + b*b), ", Mean = ", (a + b)/2.0;

What do you say?

sqrt(a*a + b*b) is not the Median. See the definition of Median here

http://en.wikipedia.org/wiki/Median

median is also determined by the number of items in the list. if it is odd, then it would be the item in the middle else the average of two central items