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 ?
What do you mean by minimum height of a Binary Search Tree?
binary trees;java