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

Answer 1

For some applications, B-trees are significantly faster than BSTs. The trees you may find here:

http://freshmeat.net/projects/bps

are quite fast. They also use less memory than regular BST implementations, since they do not require the BST infrastructure of 2 or 3 pointers per node, plus some extra fields to keep the balancing information.