3 citations · 3 across the 1 of their papers we have counts for
1 paper
Honghao Lin, Tian Luo, David P. Woodruff
A treap is a classic randomized binary search tree data structure that is easy to implement and supports O(\log n) expected time access. However, classic treaps do not take advanta…