Let T Be a Binary Search Tree with N Nodes,in

question 50

Short Answer

Let T be a binary search tree with n nodes,in which n > 0.The number of key comparisons is approximately O(____________________).