Search times for binary search tree

Question

Does anyone know how to figure out search time for a binary search tree(i.e. worst-case, best-case, and average-case)?

Answer 1

Best case is O(1). the first element could be the item you are looking for. worst case is O(n) ie in a skewed tree and average case is O(lg n).