Posted by key vs. data on July 30, 2001 at 19:24:52:
I'm trying to understand the code the Dr. VW has given for red black trees-- why does he lookup up and insert by key... he makes comparisons like if (key < root->key) If we're inserting by some order of data, shouldn't we compare data instead of keys... Anyone know?