What is the reason behind the simplicity of a treap?

Category: QuestionsWhat is the reason behind the simplicity of a treap?
Editor">Editor Staff asked 4 weeks ago

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
 
I would like to ask this question from Binary Trees in division Binary Trees of Data Structures & Algorithms I
 
I have been asked this question during an interview.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Right option is (d) Each node has a fixed priority field
 
The explanation is: A treap is the simplest of all because we don’t have to worry about adjusting the priority of a node.