+1 vote
in Data Structures & Algorithms I by (110k points)
Does Van Emde Boas data structure perform all operation in O (log (log M)) time where M = 2^m.

(a) True

(b) False

My question is based upon Trees in division Trees of Data Structures & Algorithms I

The question was posed to me in an international level competition.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right choice is (a) True

Best explanation: All the operations performed on the Van Emde Boas tree with an associative array like Insertion, Deletion, Searching and many more can be performed in O (log (log M)) time where M = 2^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.