GATE CSE 2025 CS Q57: Databases

In a B⁺- tree where each node can hold at most four key values, a root to leaf path consists of the following nodes:

A = (49, 77, 83, -), B = (7, 19, 33, 44), C = (20*, 22*, 25*, 26*)

The *-marked keys signify that these are data entries in a leaf.

Assume that a pointer between keys

and

points to a subtree containing keys in

, and that when a leaf is created, the smallest key in it is copied up into its parent.

A record with key value 23 is inserted into the B⁺- tree.

The smallest key value in the parent of the leaf that contains 25* is __________. (Answer in integer)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

EXPLORE & PRACTISE

Paper and topic context

See where this question comes from and choose what to practise next.

Explore more previous year questions using this question’s imported topic tags.

You’re not logged in. Log in or create an account to see discussions and add comments.