Vidyalelo
Data Structure · Q137

Trees in Data Structures

Programming · Data Structure · question 137

Q137

What is the worst case time complexity of delete operation(n is the no. of candidates)?

A.
O(1)
B.
O(n)
Answer
C.
O(log n)
D.
O(n log n)

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board