GATE CS 2024 Set 1 — Question 21
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33EasyB & B+ TreesTreesProgramming & Data StructuresB+ Tree OperationsIndexing & File OrganizationDatabases
Databases → Indexing & File Organization → B & B+ Trees
Last updated
Question
In a tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?
Correct answer
(A) Only the root node
Solution
In a tree of order , the standard properties are:
1.Every node except the root must be at least half-full. For an internal node, this means it must have at least children. For a leaf node, it must have at least keys.
2.The root node is the exception. If it is an internal node, it must have at least 2 children. If it is the only node in the tree (a leaf), it can have as few as 1 key.
Therefore, the 50% occupancy requirement is relaxed only for the root node.Continue learning with Success Tracker
A step still unclear? Work through it with support
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.
More questions on Indexing & File Organization
2026 Set 2 Q12The set T represents various traversals over binary tree. The set S represents the order of…2026 Set 2 Q15In the context of DBMS, consider the two sets T and S given below. | T | S | |---|---| | I:…2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 2 Q20Consider concurrent execution of two transactions and in a DBMS, both of which access a…2026 Set 1 Q23Let be an odd number greater than 100. Consider a binary minheap with elements stored in an…