ckuehne··on Aguri: Coolest Data Structure You've Never Heard OfI guess your school sucked. Red-black trees ARE binary search trees. Also: the worst case behavior of a hash table is in fact worse than that of a balanced (red-black tree, b-tree, avl-tree) search tree.