What is one of the main reasons for using a B Tree?

• Ability to store a large number of keys in a single node

• Necessity to have a high tree height

• Ability to have an unlimited number of children in a node

• Necessity to have all nodes with the same number of children

What happens when a leaf node in a B Tree does not contain m/2 keys?

• Fill the keys with elements from the right neighboring node

• Fill the keys with elements from the left neighboring node

• Delete the leaf node

• Create a new leaf node by merging with the neighboring node and the parent node's intermediate element

What is the time complexity of searching for an element in a B Tree?

• O(logn)

• O(n)

• O(1)

• O(n^2)

What happens when deleting a node from a B Tree?

• Fill the keys with elements from the neighboring node to the right

• Delete the node and reorganize the tree to maintain B Tree properties

• Create a new leaf node by merging with the neighboring node and the intermediate element of the parent node

• Delete the node without affecting the tree structure

What is one of the applications of a B Tree?

• Sorting data in RAM memory

• Indexing data and quick access to data stored on disks

• Quick calculation of complex mathematical values

• Compression of large files

What happens when a leaf node does not contain m/2 keys and none of its neighbors contain enough keys?

• The node is removed without affecting the tree structure

• A new leaf node is created by merging with the neighbor node and the parent node's intermediate element

• The node is removed and the tree is reorganized to maintain B Tree properties

• The keys are filled with elements from the right neighbor node

What is one of the properties of a B Tree?

• Each node in a B Tree contains at most m children

• Each node in a B Tree contains at most 2 keys

• Root nodes must have at least 3 keys

• All leaf nodes must have the same number of children

What is one of the characteristics of a B Tree?

• Each node in a B Tree contains at most m children

• The root nodes must have at least 3 keys

• Each node in a B Tree contains at most 2 keys

• All leaf nodes must have the same level

What happens when inserting an element into a B Tree and the leaf node already contains m-1 keys?

• Remove an element from the leaf node

• Fill the keys with elements from the right neighbor node

• Create a new leaf node by merging with the right neighbor node and the parent node's intermediate element

• Split the node into two at the median keys and move the median to the parent

What is one of the characteristics of a B Tree of order m?

• Each node in a B Tree contains at most 2 keys

• The root nodes must have at least 3 keys

• Each node in a B Tree contains at most m children

• All leaf nodes must have the same level