olad

itt we name our fav data structure

I have 2 favorite ones (I couldn't decide to go for just one of them):
- Skip Lists
- Dancing Links

>>12
"A splay tree is a self-balancing binary search tree with the additional unusual property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look-up and removal in O(log(n)) amortized time."

skip lists also perform all that in O(log(n))

so whats better in splay trees? I'm still not convinced