A

Admin • 833.24K Points
Coach

Q. B-tree of order n is a order-n multiway tree in which each non-root node contains

  • (A) at most (n – 1)/2 keys
  • (B) exact (n – 1)/2 keys
  • (C) at least 2n keys
  • (D) at least (n – 1)/2 keys

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.