Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Binary Heap Binary Search Tree
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?
1
O(n)
2
O(1)
3
O(log n)
4
O(nlogn)