Recent questions tagged b-tree

Consider $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?$1$$2$$3$$4$

In a relational database, a $\mathrm{B}+$ Tree Index is to be constructed for a relation on a key field. In a $\text{B+}$ Tree, a Node Pointer points to a sub-tree and a ...

Consider a B+ Tree where the maximum number of key values in each leaf node is $2$ and the maximum number of pointers in each non-leaf node is $3$. Let the content of the...

Which of the following trees are height balanced?Binary Search TreeAVL TreeRed-Black TreeB TreeChoose the correct answer from the options given below:$\text{I}$ and $\tex...

Which of the following description(s) is/are true:Red Black Tree - Guarantees worst case of $\mathrm{O}(\log \mathrm{n})$ time for search, insert \& delete.Trie - Used fo...

$2-3-4$ trees are $\text{B}$ - trees of order $4$. They are isometric of ________ trees.AVLAA$2-3$Red-Black

Which of the following is/are NOT CORRECT statement?The first record in each block of the data file is known as actor record.Dense index has index entries for every searc...

What is a key advantage of $\text{B} +$ trees over $\text{B} - $ trees?$\mathrm{B}+$ trees allow multiple key values per node$\mathrm{B}+$ trees use more disk space$\math...

In a $\mathrm{B}^{+}$- tree where each node can hold at most four key values, a root to leaf path consists of the following nodes:\[\mathrm{A}=(49,77,83,-), \mathrm{B}=(7...