cactus25
April 26th, 1999, 10:26 AM
I have taken a couple of Red-Black tree implementations for C and updated them
for C++, but I am having a heck of a time getting it to work.
I need a really good tree algorithm which can balance itself, as much of the time data will be inputed sequentially.
Any ideas on something other than a Red/Black, or where I can find good
examples in C++ for them?
for C++, but I am having a heck of a time getting it to work.
I need a really good tree algorithm which can balance itself, as much of the time data will be inputed sequentially.
Any ideas on something other than a Red/Black, or where I can find good
examples in C++ for them?