Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightTrees

Trees MCQs

chevron_left Back Page 1/14 chevron_right Next
  • 1. How do you determine the cost of a spanning tree?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 2. In an arbitrary tree ( not a search tree) of order M. Its size is N, and its height is K. The computation time needed to find a data item on T is
  • filter_dramaExplanation
    Answer is : C
    None.
  • 3. What would be the cost value for any answering node of a sub tree with root
  • filter_dramaExplanation
    Answer is : B
    None.
  • 4. How many nodes are there in a full state space tree with n = 6?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 5. How many minimum number of spanning trees, one can have from a given connected graph with N nodes is having different weights for the edges.
  • filter_dramaExplanation
    Answer is : B
    None.
  • 6. The following formula is of :

    left_subtree (keys) ? node (key) ? right_subtree (keys)
  • filter_dramaExplanation
    Answer is : C
    None.
  • 7. Binary search tree has best case run-time complexity of ?(log n). What could the worst case?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 8. In order traversal of binary search tree will produce ?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 9. In binary heap, whenever the root is removed then the rightmost element of last level is replaced by the root. Why?
  • filter_dramaExplanation
    Answer is : B
    None.
  • 10. If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then
  • filter_dramaExplanation
    Answer is : B
    None.
chevron_left Back Page 1/14 chevron_right Next
leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points