Question

    Which is not true for B-Tree?

    A All leaves are at same level. Correct Answer Incorrect Answer
    B Number of children of a node is equal to the number of keys in it plus 1. Correct Answer Incorrect Answer
    C time complexity to search, insert and delete is O(nLogn). Correct Answer Incorrect Answer
    D B-Tree grows and shrinks from the root Correct Answer Incorrect Answer
    E All are true Correct Answer Incorrect Answer

    Solution

    time complexity to search, insert and delete is O(Logn).

    Practice Next