Q207
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
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board