Top

Discussion

Maximum height of a B+ tree of order m with n key values is

  • A.Logm(n)
  • B.(m+n)/2
  • C.Logm/2(m+n)
  • D.None of these

Answer: D

No answer description available for this question
 

No comment is present. Be the first to comment.
Loading…

Post your comment