B-tree faster than AVL or RedBlack-Tree? [closed]

Answer 1

Guys from Google recently released their implementation of STL containers, which is based on B-trees. They claim their version is faster and consume less memory compared to standard STL containers, implemented via red-black trees. More details here