Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightBinary Trees

Binary Trees MCQs

chevron_leftBack Page 2/12 chevron_right Next
  • 11. If yyy, xxx and zzz are the elements of a lexically ordered binary tree, then in preorder traversal which node will be traverse first
  • filter_dramaExplanation
    Answer is : A
    None.
  • 12. If all c(i, j )
  • filter_dramaExplanation
    Answer is : B
    None.
  • 13. Recursive algorithms are based on
  • filter_dramaExplanation
    Answer is : C
    None.
  • 14. Worst case efficiency of binary search is
  • filter_dramaExplanation
    Answer is : A
    None.
  • 15. The time complexity of binary search in best, worst cases for an array of size N is
  • filter_dramaExplanation
    Answer is : B
    None.
  • 16. Which of the following searching methods requires that all keys must reside in internal memory?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 17. Sequential search has a time complexity of O(n), and binary search has a time complexity of O(log(n)). What difference will it make when the size n is 1000?
  • filter_dramaExplanation
    Answer is : D

    log(1024) = 10,  1000/log(1000) is roughly equal to 1000/10 = 100

  • 18. Worst case time complexity of binary search is ______________
  • filter_dramaExplanation
    Answer is : D
    None.
  • 19. Best case time complexity of binary search is ______________
  • filter_dramaExplanation
    Answer is : D
    None.
  • 20. Average case time complexity of binary search is ______________
  • filter_dramaExplanation
    Answer is : D
    None.
chevron_leftBack Page 2/12 chevron_right Next
leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points