Vidyalelo
Data Structure · Q90

Trees in Data Structures

Programming · Data Structure · question 90

Q90

What is the time complexity for finding a maximum and minimum integer in Van Emde Boas data structure?

A.
O (log M!)
B.
O (M!)
C.
O (1)
Answer
D.
O (log (log M))

Answer: Option C

Solution

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