+1 vote
in Data Structures & Algorithms I by (110k points)
What is the time complexity for storing the maximum number of elements in Van Emde Boas tree if M is the maximum number of elements?

(a) O (log M)

(b) O (M!)

(c) O (M)

(d) O (1)

This interesting question is from Trees topic in division Trees of Data Structures & Algorithms I

The question was posed to me during an internship interview.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Correct option is (c) O (M)

The best I can explain: In order to store the maximum number of elements in Van Emde Boas data structure where M is the maximum number of elements, the tree has great efficiency for storing them. So the time complexity for worst case is found to be O (M).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...