Exams › GATE › Technical

Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?

1. B+ Tree is a height-balanced tree
2. Non-leaf nodes have pointers to data records
3. Key values in each node are kept in sorted order
4. Each leaf node has a pointer to the next leaf node

Correct answer: Non-leaf nodes have pointers to data records

Solution

Non-leaf nodes in a B+ tree do not contain pointers to actual data records; instead, they only store keys and pointers to child nodes, which helps in navigating the tree structure. This characteristic distinguishes B+ trees from other tree structures, ensuring efficient searching and maintaining balance.

Related GATE Technical questions

• A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?
• Which one of the following kinds of derivation is used by LR parsers?
• In 16-bit 2’s complement representation, the decimal number −28 is:
• Let U = {1,2,...,n}. Let A = {(x,X)|x ∈ X, X ⊆ U}. Consider the following two statements on |A|. I. |A| = n2^(n−1) II. |A| = ∑(k=1 to n) k C(n,k) Which of the above statements is/are TRUE?
• Which one of the following is NOT a valid identity?
• If L is a regular language over Σ = {a, b}, which one of the following languages is NOT regular?

⚔️ Practice GATE Technical free + battle 1v1 →