# Van Emde Boas Tree Multiple Choice Questions and Answers (MCQs)

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Van Emde Boas Tree”.

1. Which type of tree does Van Emde Boas require to perform basic operations?
A) Unbalanced
B) Balanced
C) Complete
D) Non – Binary

Explanation: The data structure Van Emde Boas Tree is also known as the Van Emde Boas Priority Queue. For the specified integer keys, this data structure implements the array associatively. Peter Van Emde Boas came up with the idea. It’s a tree that isn’t binary.

2. 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))

Explanation: The operation on an associative array may be used to insert a key or integer into the Van Emde Boas data structure. As a result, inserting a key or integer into a Van Emde Boas data structure takes O (log (log M)) time.

3. In which year was Van Emde Boas tree invented?
A) 1972
B) 1973
C) 1974
D) 1975

Explanation: The data structure Van Emde Boas Tree is also known as the Van Emde Boas Priority Queue. For the specified integer keys, this data structure implements the array associatively. It was founded in 1975 by Peter Van Emde Boas.

4. 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)

Explanation: The operation can be performed on an associative array to delete a key or integer in the Van Emde Boas data structure. As a result, deleting a key or integer in a Van Emde Boas data structure takes O (log (log M)) time.

5. Can operation like Find Next and Find Previous be implemented.
A) True
B) False

Explanation: To perform various operations, the Van Emde Boas data structure uses an associative array abstract data type. As a result, operations such as Find Next and Find Previous should be introduced.

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))

Explanation: The operation can be performed on an associative array to find a maximum or minimum integer in the Van Emde Boas data structure. As a result, finding a maximum or minimum integer in the Van Emde Boas data structure has an O time complexity (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

Explanation: The data structure Van Emde Boas Tree is also known as the Van Emde Boas Priority Queue. For the specified integer keys, this data structure implements an abstract data form called associative array.

8. Which operation find the value associated with a given key?
A) Insert
B) Find Next
C) Look up
D) Delete

Explanation: For the specified integer keys, this data structure implements an abstract data form called associative array. As a result, the Look Up operation is used to determine the value associated with a given key.

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

Explanation: The data structure Van Emde Boas Tree is also known as the Van Emde Boas Priority Queue. For the specified integer keys, this data structure implements the array associatively. Peter Van Emde Boas came up with the idea.

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

Explanation: The data structure Van Emde Boas Tree is also known as the Van Emde Boas Priority Queue. For the specified integer keys, this data structure implements the array associatively. Peter Van Emde Boas came up with the idea.

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)

Explanation: The tree is very efficient at storing the maximum number of elements in the Van Emde Boas data structure, where M is the maximum number of elements. As a result, the worst-case time complexity is determined to be O. (M).

12. Does Van Emde Boas data structure perform all operation in O (log (log M)) time where M = 2m.
A) True
B) False

Explanation: Insertion, deletion, searching, and several other operations on the Van Emde Boas tree with an associative array can be performed in O (log (log M)) time, where M = 2m.

13. 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))

Explanation: The operation can be performed on an associative array to look for a key or integer in the Van Emde Boas data structure. As a result, finding a key or integer in a Van Emde Boas data structure takes O (log (log M)) time.

A van Emde Boas tree (Dutch pronunciation: [vn md bos]) is a tree data structure that implements an associative array of m-bit integer keys. It is also known as a vEB tree or van Emde Boas priority queue. All operations are completed in O(log m) time, or O(log log M) time, where M = 2m is the maximum number of elements that can be stored in the tree. The M should not be confused with the number of elements contained in the tree, which is also used to compare the output of other tree data structures. When there are a lot of elements in the vEB tree, it saves a lot of room, as we’ll see later.