And there was a lawsuit and some legal testimony and I am happy to report that, that it was clear that Hibbard deletion was the problem once the expert analyzed it and the expert witness, who's a colleague of mine, said if implemented properly, the height of a red-black BST with N keys is at most two log N. And so that's the st ory of red-black BST's guaranteed logarithmic performance for all symbol table operations. 