GATE CS 2016 Set 2 — Question 31

MCQ+1 / -0.33EasyB+ Tree OperationsIndexing & File OrganizationDatabases

Databases → Indexing & File Organization → B+ Tree Operations

Last updated 5 September 2026

Question

B+ Trees are considered BALANCED because

Correct answer (A) the lengths of the paths from the root to all leaf nodes are all equal. Solution A B+ Tree is a self-balancing tree data structure. The defining property that makes it "balanced" is that all leaf nodes are at the same depth . This means the length of the path from the root to any leaf node is exactly the same. Turn this into a strength. Explore AI-powered practice and doubt support with Success Tracker.

Review answer and solution without JavaScript

Interactive answer checking needs JavaScript. The published solution is available below.

Correct answer (A) the lengths of the paths from the root to all leaf nodes are all equal. Solution A B+ Tree is a self-balancing tree data structure. The defining property that makes it "balanced" is that all leaf nodes are at the same depth . This means the length of the path from the root to any leaf node is exactly the same.

Continue learning with Success Tracker

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans

PYQs with solutions: Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts: Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support: Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.