Skip to content
GATEiit

GATE DA 2026 Q32: Order of a B+ tree non-leaf node

Question

In a relational database, a B+ Tree Index is to be constructed for a relation on a key field. In a B+ Tree, a Node Pointer points to a sub-tree and a Data Record Pointer points to a block of database records.

Let, Node size = 4096 bytes, Node Pointer size = 10 bytes, Search Key Field size = 11 bytes and Data Record Pointer size = 12 bytes.

The maximum number of Node Pointers that can be present in a non-leaf node of the B+ Tree is ________. (Answer in integer)

Try it: numerical answer: type the value

Numerical answer. No negative marking.
Show answer and explanation

Answer: 195 (official GATE 2026 final answer key)

Concept used: A non-leaf node with pp child pointers holds p−1p - 1 keys; data record pointers live only in leaves.

First step: 10p+11(p−1)≤409610p + 11(p - 1) \le 4096 gives 21p≤410721p \le 4107.

Full step-by-step solution

Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.

Share this question

WhatsAppDownload image

Source: official GATE 2026 DA question paper and final answer key, organised by IIT Guwahati. Question paper · Answer key

More Database Management and Warehousing PYQs

PracticePractise Database Management and Warehousing questions →Full paperAll GATE DA 2026 questions →