(14) Suppose an integer x is not in the NCTU linked list, what is the time complexity to insert the integer x into the NCTU linked list?
(A)O(logm*n/m)
(B) O(logm+n/m)
(C) O(m+n/m)
(D) O(logm*n/m+m)
(E) None of the above.

答案:登入後查看
統計: 尚無統計資料

詳解 (共 1 筆)

#7101531
題目解析 這道題目涉及到一種特殊的連結...
(共 968 字,隱藏中)
前往觀看
0
0