Treap is a data structure that is a combination of binary search tree and heap. e.g. Each node has key and value. Key belongs to BST rule and value belongs to heap rule.
van Emde Boas Trees is a data structure that divides a binary search tree into multiple sub trees for making the times of seek less. (You don't have to visit every node from root like binary search tree. You can just seek root of the sub trees first.)
1
Advanced Data Structures: Treaps
Cache Oblivious Search
