At least n/2 record pointers and n/2 key values can be contained in a/an/the ___ node(s) of the B+ tree

12. At least n/2 record pointers and n/2 key values can be contained in a/an/the ___ node(s) of the B+ tree.

  1. Leaf
  2. Internal
  3. Both A and B
  4. None of the above

Answer: C) Both A and B

Explanation:

At least n/2 record pointers and n/2 key values can be contained in a leaf node of the B+ tree.

Comments and Discussions!

Load comments ↻






Copyright © 2024 www.includehelp.com. All rights reserved.