Top MCQs on Binary Search Tree (BST) Data Structure with Answers

Question 41

A binary search tree T contains n distinct elements. What is the time complexity of picking an element in T that is smaller than the maximum element in T?

• Θ(nlogn)
• Θ(n)
• Θ(logn)
• Θ(1)