Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightIn .............., it is possible to traverse a tree without using sta...

In .............., it is possible to traverse a tree without using sta...

  • Q. In .............., it is possible to traverse a tree without using stacks either implicitly or explicitly.
  • filter_dramaExplanation
    Answer is : C
    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. In .............., it is possible to traverse a tree without using stacks either implicitly or explicitly.
  • filter_dramaExplanation
    Answer is : C
    None.
  • 2. 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.
  • 3. The order of a B-Tree with 2, 3, 4 or 5 children in every internal node is
  • filter_dramaExplanation
    Answer is : C
    None.
  • 4. B Trees are generally
  • filter_dramaExplanation
    Answer is : D
    None.
  • 5. Every internal node in a B-tree of minimum degree 2 can have
  • filter_dramaExplanation
    Answer is : B
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points