GATE 2016 CS (CS2) – Question 31

Databases · File Organization and Indexing (B and B+ Trees) · 1 mark · Multiple choice

B+ trees are considered balanced because

All root-to-leaf path lengths are equal.
Root-to-leaf path lengths differ by at most one.
Nonleaf siblings have child counts differing by at most one.
Leaf record counts differ by at most one.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (A) All root-to-leaf path lengths are equal.

Explanation

Every data leaf of a B+ tree is at the same depth. Hence all root-to-leaf paths have equal length, A. Node occupancy can vary within permitted limits; balancing does not require equal or nearly equal record or child counts.

More File Organization and Indexing (B and B+ Trees) questions

GATE 2017 CS (CS2) Q59 – A B+ tree has eight-byte search keys, 512-byte blocks and two-byte block pointers. Find…
GATE 2013 CS (CS1) Q25 – An index is clustered if
GATE 2011 CS (CS1) Q49 – A large relation r has attributes A₁,…,Aₙ. Q₁ projects A₁,…,Aₙ after selecting Aₚ=c. Q₂…
GATE 2010 CS (CS1) Q28 – A B+ tree allows at most five keys per node. Find the minimum number of keys in any…
GATE 2015 CS (CS2) Q32 – For the B+ tree of order 1 shown, find the minimum number of index nodes, including the…
GATE 2015 CS (CS3) Q39 – A B+ tree has 12-byte search keys, 1024-byte blocks, 10-byte record pointers and 8-byte…

All File Organization and Indexing (B and B+ Trees) questions →