Data Structure (DS) MCQ: What are the worst case and average case complexities of a binary search tree?

What are the worst case and average case complexities of a binary search tree?

Correct Answer: O(n), O(logn)

Make the most of this question

This page focuses on one Data Structure (DS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Data Structure (DS) MCQs All Engineering topics Mock test hub

WhatsApp+91 99922 70404Data Structure (DS) MCQ: What are the worst case and average case complexities of a binary search tree? | Extra Education