Skip to content
Related Articles

Related Articles

UGC-NET | UGC NET CS 2017 Jan – III | Question 12
  • Last Updated : 05 Apr, 2018
GeeksforGeeks - Summer Carnival Banner

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)b+ (1)
(2)b+ (2)
(3)b+ (4)
(4)b+ (3)
(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.
b+ (1)
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.

My Personal Notes arrow_drop_up
Recommended Articles
Page :