Treap Multiple choice Questions and Answers (MCQs)

 

 Help authour, Buy PDF Ebook   >>>Click Here<<<

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)
HRM Questions answers
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
HRM Questions answers
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
Reasoning Questions answers
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
Reasoning Questions answers
Question 4 Explanation: 
A treap is the simplest of all because we don't have to worry about adjusting the priority of a node.

Question 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
Education Questions answers
Question 5 Explanation: 
A node's priority should satisfy heap order. That is, any node's priority should be at least as large as its parent.

There are 5 questions to complete.

 

 Help authour, Buy PDF Ebook   >>>Click Here<<<