With reference to the B+ tree index of order 1 shown below, the minimum number of nodes (including the root node) that must be fetched in order to satisfy the following query: “Get all records with a search key greater than or equal to 7 and less than 15” is ________

A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are

If you have a computer file with 2 million records and utilize a B+ tree index with a tree order of 200, what is the maximum number of nodes you may need to access?

In a Binary Search Tree, the left subtree of a node contains only nodes with keys _______ the node’s key.greater thanless thanequal togreater than or equal to

Where is the maximum number in a binary search tree? a) At the root of the tree. b) Anywhere other than root and leaf nodes c) At the leftmost leaf node. d) At the rightmost leaf node

Consider a B+-tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?*2 points1234