問題詳情
7. When a data set is too large to be accommodated in internal memory, a multi-way (say m-way or order m) search tree is used as an indexing structure and is stored on a disk. Assume the size of each node on the disk is 512 bytes. Assume each node contains key values (each key 5 bytes), and pointers to subtreenodes(each pointer 7 bytes).
【題組】(19) What is the order m of the m-way tree ?
(A) 45
(B) 50
(C) 43
(D) 44
(E) None of the above
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增