On Fri, Apr 29, 2011 at 8:07 AM, Yuan Pengfei <cool...@qq.com> wrote:
> B+ tree is more commonly used in file systems. In memory, I think RB-tree is 
> better.
> RB-tree vs. hash table is just like map vs. unordered_map.
>
Any balanced tree that have O(log(n)) lookup complexity, including splay tree.


-- 
Chiheng Xu
Wuhan,China

Reply via email to