In a B+ tree data structure with 1000000 records and order of the tree is 100.
Optym technical mcq question, verified with a worked answer. Free to practise - no sign-up.
In a B+ tree data structure with 1000000 records and order of the tree is 100. How many nodes to be accessed in the maximum.
Show answer & explanation
Answer: C. C) 4
With order 100, the maximum depth/height of the tree to store 10^6 records is ceil(log_100(10^6)) + 1 = 3 + 1 = 4 nodes accessed from root to leaf.
Step-by-step Derivation:
Step 1: Number of records N = 1,000,000.
Step 2: Fanout order = 100.
Step 3: Height of B+ tree h = ceil(log_100(1,000,000)) = 3 levels of index nodes + 1 leaf = 4 nodes.