# Treap Multiple choice Questions and Answers (MCQs)

## Treap Multiple choice Questions and Answers (MCQs)

 Question 1
What is the space complexity of a treap algorithm?
 A O(N) B O(log N) C O(log N) D O(N2)
Question 1 Explanation:
The average case and worst case space complexity of a treap is mathematically found to be O(N).

 Question 2
A treap is a combination of a tree and a heap.
 A false B true
Question 2 Explanation:
A treap is a combination of a tree and a heap. The structure of a treap is determined by the fact that it is heap-ordered.

 Question 3
Which is the simplest of all binary search trees?
 A AVL tree B Treap C Splay tree D Binary heap
Question 3 Explanation:
A treap is the simplest of all binary search trees. Each node is given a numeric priority and implementation is non recursive.

 Question 4
What is the reason behind the simplicity of a treap?
 A Each node has data and a pointer B Each node is colored accordingly C It is a binary search tree following heap principles D Each node has a fixed priority field