GATE CS 2024 Set 1 — Question 21
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?
A.
Only the root node
B.
All leaf nodes
C.
All internal nodes
D.
Only the leftmost leaf node
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.More questions on Indexing & File Organization
2024 Set 2 Q13Consider the following C program. Assume parameters to a function are evaluated from right to left.…2024 Set 2 Q17Let be the adjacency matrix of a simple undirected graph . Suppose is its own inverse.…2024 Set 1 Q17Given an integer array of size , we want to check if the array is sorted (in either ascending or…2024 Set 1 Q18Consider the following C program: [code] Which one of the following statements is CORRECT?2024 Set 1 Q19Consider the following C program: [code] Assume that the input to the program from the command line…
Practice GATE CS PYQs with adaptive difficulty
Timed practice, skill tracking, and AI explanations — free to start.
Start practicing free