If following sequence of keys are inserted in a B⁺ tree with K(=3) pointers:
8, 5, 1, 7, 3, 12, 9, 6
Which of the following shall be correct B+ tree?
(1)
(2)
(3)
(4)
(A) (1)
(B) (2)
(C) (3)
(D) (4)


Answer: (A)

Explanation: B⁺ is either left biased (<=) or it is right biased (>=), all trees except (1) is violating the biasing property.

For more information on B⁺ Refer:Database File Indexing – B+ Tree (Introduction)
Option (A) is correct.


Quiz of this Question

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.