Which node has the lowest priority in a treap?
(a) root node
(b) leaf node
(c) null node
(d) centre node
The query is from Binary Trees topic in chapter Binary Trees of Data Structures & Algorithms I
I got this question during a job interview.