Quiz despre B+ Tree

What type of data structure is a B+ Tree?

• Stack

• Queue

• Tree

• List

What type of data can only be stored in the leaf nodes of a B+ Tree?

• Keys and data

• Only data

• Data

• Keys

What is the main advantage of using B+ Tree for data storage?

• Efficiency in insertion

• Efficiency in deletion

• Efficiency in search

• Efficiency in update

What happens when a leaf node in a B+ Tree contains more elements than the maximum allowed?

• The node is split and the median node is placed in the parent

• A copy of the node is made

• The excess elements are removed

• Additional space is added to the node

What is the main difference between B Tree and B+ Tree in terms of data storage?

• B+ Tree stores keys and data in leaf nodes

• B+ Tree stores only data in leaf nodes

• B Tree stores keys and data in internal nodes

• B Tree stores only keys

What happens in a B+ Tree when an element is removed from an internal node?

• The node is split and the median node is placed in the parent

• The element is removed

• A copy of the node is made

• Additional space is added to the node

What is the process of insertion in a B+ Tree?

• Merging the node with its sibling

• Copying the node

• Splitting the node and placing the median node in the parent

• Moving the key between nodes

What happens when an internal node in a B+ Tree contains fewer elements than the minimum allowed number?

• A copy of the node is made

• The excess elements are removed

• The node is split and the median node is placed in the parent

• The node is merged with its sibling

What is the main advantage of linking leaf nodes in a B+ Tree?

• Efficiency in search

• Efficiency in deletion

• Efficiency in insertion

• Efficiency in navigation

What happens when a leaf node in a B+ Tree contains fewer elements than the minimum allowed number?

• Make a copy of the node

• Remove the excess elements

• Merge the node with its sibling

• Split the node and place the median node in the parent