B-Tree Quiz Solutions

What is the core defining structural property of a B-Tree?

• A) A binary search tree that is strictly balanced height-wise.
• B) A self-balancing search tree layout that keeps keys sorted and allows logarithmic lookups, inserts, and structural deletes.
• C) A narrow tree structure restricted exactly to three node pathways.
• D) A specialized radix tree structure built exclusively to store string sets.
  Answer: B) A self-balancing search tree layout that keeps keys sorted and allows logarithmic lookups, inserts, and structural deletes.
  Explanation: A B-Tree is a self-balancing search tree engineered optimized for files and high-density database storage layers. By allowing nodes to house more than two branch links, it drops traversal depths while ensuring stable O(log n) performance lines.

How does the minimum degree 't' dictate the bounds of non-root nodes in a B-Tree?

• A) It dictates the absolute minimum number of keys a non-root node can contain.
• B) It sets the absolute upper threshold of children branches allowed.
• C) It represents the maximum key capacity of a leaf cluster.
• D) It specifies the exact count of depth levels allowed inside the workspace.
  Answer: A) It dictates the absolute minimum number of keys a non-root node can contain.
  Explanation: The factor 't' sets lower structural floor allocations. Non-root nodes must retain at minimum t - 1 keys. Consequently, they hold a minimum of 't' branching child references.

In a B-Tree configuration with minimum degree 't', what is the maximum number of children any node can maintain?

• A) 2
• B) 3
• C) 2t
• D) t
  Answer: C) 2t
  Explanation: A node can accept up to 2t - 1 keys maximum. Exceeding this boundary requires a split, meaning the upper threshold limit for children paths caps out cleanly at exactly 2t.

What architectural advantage makes B-Trees preferred over classic self-balancing BSTs for external disk memory structures?

• A) Faster processing cycles across local CPU registries.
• B) Minimal footprint allocations inside active virtual memory maps.
• C) Extreme horizontal node fan-out which ensures low height paths to minimize costly storage read operations.
• D) Streamlined implementation simplicity during multi-threaded executions.
  Answer: C) Extreme horizontal node fan-out which ensures low height paths to minimize costly storage read operations.
  Explanation: B-Trees maximize horizontal data density per block. Storing multiple keys together ensures high fan-out, reducing tree height. This directly minimizes expensive disk or system I/O cycles.

What workflow is executed when an insertion step causes a target node to surpass its maximum permitted key allowance?

• A) The node undergoes deletion and the storage block gets scrubbed.
• B) The complete tree path gets purged and rebuilt from scratch.
• C) The target node splits into two parts, and its median key is pushed up to its parent.
• D) Overflows are cached loosely in memory without mutating the tree structures.
  Answer: C) The target node splits into two parts, and its median key is pushed up to its parent.
  Explanation: When a node exceeds 2t - 1 keys, it splits. The middle key moves into the parent node, and the remaining keys form two balanced sibling nodes of size t - 1.

What exact height invariant must be continually maintained for a B-Tree to be classified as fully balanced?

• A) Every leaf node must reside at the exact same depth level.
• B) The key distributions across all nodes must match perfectly.
• C) Every active internal node must hold a uniform count of branches.
• D) The structural outline must simulate a dense complete binary profile.
  Answer: A) Every leaf node must reside at the exact same depth level.
  Explanation: Unlike AVL trees where leaf heights vary slightly, B-Trees are perfectly balanced from the bottom up—meaning every single leaf node sits at the exact same depth level.

How does a B-Tree process a key deletion when the target node drops below its minimum key threshold?

• A) The key is cleared out immediately, ignoring underflow bounds.
• B) Keys are shifted around locally within that single isolated node block.
• C) The node borrows a key from a valid adjacent sibling or merges with it, pulling a key from its parent node.
• D) Deletions are forbidden to protect the integrity of historical node configurations.
  Answer: C) The node borrows a key from a valid adjacent sibling or merges with it, pulling a key from its parent node.
  Explanation: If a node underflows (falling below t - 1 keys), it must rebalance. It borrows a key from an immediate sibling via a rotation step or merges with a sibling by bringing down a parent key.

Which of the following structural assertions is FALSE regarding standard B-Tree constraints?

• A) Every leaf node is located at the identical level boundary.
• B) Internal nodes are guaranteed to house at least t - 1 keys.
• C) The root node is required to contain at minimum 't' keys at all times.
• D) Nodes cannot support an un-bounded or arbitrary count of children slots.
  Answer: C) The root node is required to contain at minimum 't' keys at all times.
  Explanation: The root node is exempt from the typical lower bound constraint. It can operate legally with as little as one single key and two children, even if the tree's overall degree 't' is much higher.

In which software engineering domains do B-Trees and their variations find their most widespread application?

• A) Volatile low-latency register stores.
• B) Solid-state file system layers and relational database index systems.
• C) Standard in-memory stack configurations.
• D) Ephemeral string pattern matching maps.
  Answer: B) Solid-state file system layers and relational database index systems.
  Explanation: B-Trees form the baseline architecture for major disk indexing components—including database configurations like InnoDB, PostgreSQL, and robust file system architectures like NTFS and ext4.

How do adjustments to the overall tree order or degree ('t') directly affect the net height metrics of a B-Tree?