Does Van Emde Boas Data Structure Perform All Operation In O (log (log M)) Time Where M = 2^m.

› Category: Questions › Does Van Emde Boas data structure perform all operation in O (log (log M)) time where M = 2^m.

Editor Staff asked 5 months ago

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.

Question Tags: Interview-Questions-Answers

1 Answers

0 Vote Up Vote Down

Editor">

Editor Staff answered 5 months ago

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 Posts

Most commonly asked OpenAI interview questions and answers

Common AI interview questions and answers:

How do you uninstall gulp?