What is the reason behind the simplicity of a treap?
Posted: Wed Jul 13, 2022 7:42 pm
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
b) Each node is colored accordingly
c) It is a binary search tree following heap principles
d) Each node has a fixed priority field