Top MCQs on B and B+ Trees with Answers

Question 11

Which of the following is FALSE about B/B+ tree

• B/B+ trees grow upward while Binary Search Trees grow downward.
• Time complexity of search operation in B/B+ tree is better than Red Black Trees in general.
• Number of child pointers in a B/B+ tree node is always equals to number of keys in it plus one.
• A B/B+ tree is defined by a term minimum degree. And minimum degree depends on hard disk block size, key and address sizes.

Question 12

The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?

• 24
• 25
• 26
• 27

Question 13

A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are

• 5
• 4
• 1
• 2

Question 14

In a file which contains 1 million records and the order of the tree is 100, then what is the maximum number of nodes to be accessed if B+ tree index is used?

• 5

• 4

• 3

• 10

Question 15

B+ Trees are considered BALANCED because

• the lengths of the paths from the root to all leaf nodes are all equal.
• the lengths of the paths from the root to all leaf nodes differ from each other by at most 1.
• the number of children of any two non-leaf sibling nodes differ by at most 1.
• the number of records in any two leaf nodes differ by at most 1.

Question 16

Which of the following is correct?

• B-trees are for storing data on disk and B+ trees are for main memory.
• Range queries are faster on B+ trees.
• B-trees are for primary indexes and B+ trees are for secondary indexes.
• The height of a B+ tree is independent of the number of records.