Consider a completely skewed (left / right) binary search tree with n elements. What is the worst case time complexity of searching an element in this tree?
In a completely skewed BST (every node has only a left child, or only a right child), the tree is effectively a linked list of height \(n\).
In the worst case, searching visits all \(n\) nodes.
So the worst-case search time is \(O(n)\).
Answer: (A) \(O(n)\)
Reinforce your conceptual grasp with related questions from CUET-MCA 2024:
Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.
Start Free Mock Test Series →