Consider B⁺-tree of order d shown in figure? (A) B⁺-tree of order d contains…

PYQ GATE 1994Modified — slightly modified from the official paper; see the solution

Consider B⁺-tree of order d shown in figure?

(A) B⁺-tree of order d contains between d and 2d keys in each node

(a) Draw the resulting B⁺-tree after 100 is inserted in the figure.

B+ tree with root keys 25, 38, 69, 93 and five linked leaves: [10,15], [25,36], [39,41,47], [69,71,75,83], [95,99,101,105].

(b) For a B⁺-tree of order d with n leaf nodes, the number of nodes accessed during a search is O(—).

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…