10. (4 x 2 points) True or False Questions. If your answer is False, please briefly
justify.(No point is given without justification if the answer is False)
申論題內容
(c) Searching a specific key in a binary search tree takes O(log n) time, where n
is the number of keys in the binary search tree.
阿摩線上測驗
登入