B-tree Basics

A tree data structure that maintains sorted data and allows for efficient operations such as searching, insertion, and deletion (correct)

A linked list data structure that maintains sorted data and allows for efficient operations such as searching, insertion, and deletion

A tree data structure that maintains unsorted data and allows for inefficient operations such as searching, insertion, and deletion

A graph data structure that maintains sorted data and allows for efficient operations such as searching, insertion, and deletion

To increase the height of the tree

To keep the tree balanced (correct)

To make the search time slower

To decrease the height of the tree

It is left as is, and the next key is added to the next node

It is split into two nodes, and the median key is promoted to the parent node (correct)

It is merged with the neighboring node, and the median key is demoted to the child node

It is deleted from the tree