Red-black trees ARE binary search trees. Agreed. However the original poster said binary tree, a specific structure whose worse case behavior is O(n) just lik

Red-black trees ARE binary search trees. Agreed. However the original poster said binary tree, a specific structure whose worse case behavior is O(n) just like a hash table. They didn't say binary search tree (which as you observe may refer to one of several possible structures).