Does Van Emde Boas data structure perform all operation in O

does-van-emde-boas-data-structure-perform-all-operation-in-o

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.

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.