Thursday 28 May 2015

Q27,paper 2,J13. For a B-tree of height h and degree t, the total CPU time used to insert a node is



(A) O(h log t)
(B) O(t log h)
(C) O(t2h)
(D) O(th)
Answer(d)

No comments:

Post a Comment

Note: only a member of this blog may post a comment.