What do you mean by minimum height of a Binary Search Tree? [duplicate]

I came across the term "minimum height of a Binary Search Tree" (in Java) in class, but I don't fully understand. Could someone please elaborate on: (a) What it is ? (b) How to determine/find it ?

• Can you give more context? Apr 3 '15 at 2:59
• cs.stackexchange.com/q/6277/30102 Apr 3 '15 at 5:55
• A possible meaning might be in the context of answering "What is the least possible height of a BST containing $n$ data values?", where the answer is "approximately $\log n$". Apr 3 '15 at 15:36