We have the best collection of Van Emde Boas Tree MCQs and answer with FREE PDF. These Van Emde Boas Tree MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Van Emde Boas Tree MCQs

**1. What is the time complexity for searching a key or integer in Van Emde Boas data structure?**

a) O (log M!)

b) O (M!)

c) O (M2)

d) O (log (log M))

**Answer: **O (log (log M))

**2. Which type of tree does Van Emde Boas require to perform basic operations?**

a) Unbalanced

b) Balanced

c) Complete

d) Non – Binary

**Answer: **Non – Binary

**3. What is the time complexity for inserting a key or integer in Van Emde Boas data structure?**

a) O (log M!)

b) O (M!)

c) O (M2)

d) O (log (log M))

**Answer: **O (log M!)

**4. In which year was Van Emde Boas tree invented?**

a) 1972

b) 1973

c) 1974

d) 1975

**Answer: **1975

**5. What is the time complexity for deleting a key or integer in Van Emde Boas data structure?**

a) O (log M!)

b) O (log (log M))

c) O (M!)

d) O (M2)

**Answer: **O (log (log M))

**6. 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: **O (1)

**7. On which abstract data type does van Emde Boas tree performs the operation?**

a) Tree

b) Linked List

c) Heap

d) Associative Array

**Answer: **Associative Array

**8. Which operation find the value associated with a given key?**

a) Insert

b) Find Next

c) Look up

d) Delete

**Answer: **Find Next

**9. What is the other name or Van Emde Boas Tree data structure?**

a) Van Emde Boas Array

b) Van Emde Boas Stack

c) Van Emde Boas Priority Queue

d) Van Emde Boas Heap

**Answer: **Van Emde Boas Priority Queue

**10. Who Invented The vEB also known as Van Emde Boas Tree?**

a) Peter Van Emde Boas

b) Samuel F. B. Morse

c) Friedrich Clemens Gerke

d) Alexander Morse

**Answer: **Alexander Morse

**11. 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)

**Answer: **O (M)