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.