(b) Suppose there are n numbers in the binary search tree, what is the worst-case time complexity of searching a number in it? Please answer with big-O notation and give an example when such worst case happens. (8%)

相關申論題

相關試卷