# 50+ Treap MCQs with FREE PDF

We have the best collection of Treap MCQs and answer with FREE PDF. These Treap 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.

## Treap MCQs

#### 1. 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

Answer: Each node has a fixed priority field

a) O(N)

b) O(log N)

c) O(log N)

d) O(N2)

a) false

b) true

a) AVL tree

b) Treap

c) Splay tree

d) Binary heap

#### 5. What is the condition for priority of a node in a treap?

a) a node’s priority should be greater than its parent

b) a node’s priority should be at least as large as its parent

c) the priority is randomly assigned and can have any value

d) a node’s priority is always given in decreasing order

Answer: a node’s priority should be at least as large as its parent

a) True

b) False

a) O(N)

b) O(N log N)

c) O(log N)

d) O(M log N)

a) root node

b) leaf node

c) null node

d) centre node

a) 1

b) 0

c) random number

d) infinity

#### 10. Who invented treaps?

a) Cecilia and Raimund