問題詳情

【題組】(3) pose the binary tree is of n nodes. What is the time complexity of function u
(A)O(log n)
(B)O(n)
(C) O(n log n)
(D)O(n2)
(E) None of the above.

參考答案

答案:[無官方正解]
難度:計算中-1
書單:沒有書單,新增