Re:Aguri: Coolest Data Structure You've Never Heard Of
by ckuehne on Wednesday January 23, 2008 @04:03AM
(#102719)
I 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.
[ Parent
| on HN ]
Re:Aguri: Coolest Data Structure You've Never Heard Of
by bayareaguy on Wednesday January 23, 2008 @07:21AM
(#102758)
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).