Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightEvery internal node in a B tree of minimum degree 2 can have

Every internal node in a B-tree of minimum degree 2 can have

  • Q. Every internal node in a B-tree of minimum degree 2 can have
  • filter_dramaExplanation
    Answer is : B
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. The smallest number of key that will force a B-tree of order 3 to have a height 3 is
  • filter_dramaExplanation
    Answer is : B
    None.
  • 2. A B-tree of minimum degree t can maximum _____ pointers in a node.
  • filter_dramaExplanation
    Answer is : D
    None.
  • 3. In .............., it is possible to traverse a tree without using stacks either implicitly or explicitly.
  • filter_dramaExplanation
    Answer is : C
    None.
  • 4. B+- trees are preferred to binary trees in databases because
  • filter_dramaExplanation
    Answer is : A
    None.
  • 5. B Trees are generally
  • filter_dramaExplanation
    Answer is : D
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points