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 ?
3
-
1$\begingroup$ Can you give more context? $\endgroup$– Yuval FilmusCommented Apr 3, 2015 at 2:59
-
1$\begingroup$ cs.stackexchange.com/q/6277/30102 $\endgroup$– FrançoisCommented Apr 3, 2015 at 5:55
-
$\begingroup$ 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$". $\endgroup$– Rick DeckerCommented Apr 3, 2015 at 15:36
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
1
Binary Search Trees(BST)are a class of data structures which are used to implement dynamic sets. They kind of store data pieces, whic are known as keys, and they also allow fast insertion and deletion of these keys. Also, they checkwhether a key is present in a tree.
I did not get your (b) part. Are you asking to determine whether a tree is BST or not?
-
$\begingroup$ This doesn't seem to answer the question. You don't state what the term "minimum height of a binary search tree" means. $\endgroup$ Commented Apr 4, 2015 at 9:15