What are the advantages of splay tree over hash table?

Question

Since splay trees are used for caching, I was wondering what are the advantages of Splay Tree over HashTable when I want to cache efficiently?

When should I prefer to drag a tree over a hash table?

I think this is a more specialized case than BST, there please do not mess with the answer of BST vs Hashtable.

Answer 1

It really depends on what you mean by efficiency.

/, , . , , , .

, , ( ), splay , O (log n), - O (n).

, - , 3 1 . , , , .

, , Hash , O (1).

. , "" / " " , . , , -.

, , -, , .

:)

, , ! , Google, , ! !