Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightTrees

Trees MCQs

chevron_leftBack Page 2/14 chevron_right Next
  • 11. Which method can find if two vertices x & y have path between them?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 12. Access time of a binary search tree may go worse in terms of time complexity upto
  • filter_dramaExplanation
    Answer is : C
    None.
  • 13. Visiting root node after visiting left and right sub-trees is called
  • filter_dramaExplanation
    Answer is : C
    None.
  • 14. In the deletion operation of max heap, the root is replaced by
  • filter_dramaExplanation
    Answer is : D
    None.
  • 15. All possible spanning trees of graph G
  • filter_dramaExplanation
    Answer is : A
    None.
  • 16. Maximum number of nodes in a binary tree with height k, where root is height 0, is
  • filter_dramaExplanation
    Answer is : B
    None.
  • 17. Re-balancing of AVL tree costs
  • filter_dramaExplanation
    Answer is : B
    None.
  • 18. In the
  • filter_dramaExplanation
    Answer is : A
    None.
  • 19. State true or false.i) The degree of root node is always zero.ii) Nodes that are not root and not leaf are called as internal nodes.
  • filter_dramaExplanation
    Answer is : C
    None.
  • 20. Any node is the path from the root to the node is called
  • filter_dramaExplanation
    Answer is : B
    None.
chevron_leftBack Page 2/14 chevron_right Next
leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points