Question

    Consider a B+-tree in which the maximum number of keys

    in a node is 5. What is the minimum number of keys in any non-root node? 
    A 1 Correct Answer Incorrect Answer
    B 2 Correct Answer Incorrect Answer
    C 3 Correct Answer Incorrect Answer
    D 4 Correct Answer Incorrect Answer
    E 5 Correct Answer Incorrect Answer

    Solution

    Assuming order of B+ tree as p, maximum number of keys will be (p – 1). As it is given that, p – 1 = 5 => p = 6 Therefore, minimum number of keys: ceil(p/2) – 1 = 2  

    Practice Next