Tip:A–D to answerE for explanationV for videoS to reveal answer
CUET PG 2024 — Computer PYQ
CUET PG | Computer | 2024
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?
Choose the correct answer:
A.
O(n)
(Correct Answer)
B.
O(1)
C.
O(log n)
D.
O (nlogn)
Correct Answer:
O(n)
Explanation
Equation Solution
Searching complexity nikalne ke liye height ka relation dekhte hain:
Height of Skewed BST (h)=n
Worst case mein humein root se lekar leaf tak har node ko check karna padta hai:
Time Complexity=O(height of the tree)
Time Complexity=O(h)
Chunkee skewed tree ke liye h=n, isliye:
Worst Case Complexity=O(n)
Explanation
Equation Solution
Searching complexity nikalne ke liye height ka relation dekhte hain:
Height of Skewed BST (h)=n
Worst case mein humein root se lekar leaf tak har node ko check karna padta hai:
