These are the most well known tree types in CS and banchmark results are unlikely to differ from what is widely published and written about the algorithms. Ben

These are the most well known tree types in CS and banchmark results are unlikely to differ from what is widely published and written about the algorithms. Benchmark winner would depend on what usage pattern and metric you are interested in. Binary trees are simple, AVL is a bit faster to search and slower to update than RB.