Binary Search Tree MCQ

Test your knowledge with important Binary Search Tree MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Binary Search Tree MCQs at Bissoy

• What are the conditions for an optimal binary search tree and what is its advantage?
  ক

  The tree should not be modified and you should know how often the keys are accessed, it improves the lookup cost

  খ

  You should know the frequency of access of the keys, improves the lookup time

  গ

  The tree can be modified and you should know the number of elements in the tree before hand, it improves the deletion time

  ঘ

  The tree should be just modified and improves the lookup time
• What are the worst case and average case complexities of a binary search tree?
  ক

  O(n), O(n)

  খ

  O(logn), O(logn)

  গ

  O(logn), O(n)

  ঘ

  O(n), O(logn)
• What is the speciality about the inorder traversal of a binary search tree?
  ক

  It traverses in a non increasing order

  খ

  It traverses in an increasing order

  গ

  It traverses in a random fashion

  ঘ

  It traverses based on priority of the node