What is the time complexity for finding a maximum and minimum...

Home / Data Structure / Trees In Data Structures / Question

Examveda

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)

D. O (log (log M))

Answer: Option C

Related Questions on Trees in Data Structures

A. 2

B. 3

C. 4

D. Any number

View Answer

A. Root

B. Leaf

C. Parent

D. Sibling

View Answer

A. Inorder

B. Preorder

C. Postorder

D. Level-order

View Answer

A. n-1

B. n

C. 2n-1

D. 2n

View Answer