What's a good and stable C++ tree implementation?

Question

I\'m wondering if anyone can recommend a good C++ tree implementation, hopefully one that is stl compatible if at all possible.

For the record, I\'ve written tree a

Answer 1

Let suppose the question is about balanced (in some form, mostly red black tree) binary trees, even if it is not the case.

Balanced binaries trees, like vector, allow to manage some ordering of elements without any need of key (like by inserting elements anywhere in vector), but :

• With optimal O(log(n)) or better complexity for all the modification of one element (add/remove at begin, end and before & after any iterator)
• With persistance of iterators thru any modifications except direct destruction of the element pointed by the iterator.

Optionally one may support access by index like in vector (with a cost of one size_t by element), with O(log(n)) complexity. If used, iterators will be random.

Optionally order can be enforced by some comparison func, but persistence of iterators allow to use non repeatable comparison scheme (ex: arbitrary car lanes change during traffic jam).

In practice, balanced binary tree have interface of vector, list, double linked list, map, multimap, deque, queue, priority_queue... with attaining theoretic optimal O(log(n)) complexity for all single element operations.

this is probably why c++ stl does not propose it

Individuals may not implement general balanced tree by themselves, due to the difficulties to get correct management of balancing, especially during element extraction.

There is no widely available implementation of balanced binary tree because the state of the art red black tree (at this time the best type of balanced tree due to fixed number of costly tree reorganizations during remove) know implementation, slavishly copied by every implementers’ from the initial code of the structure inventor, does not allow iterator persistency. It is probably the reason of the absence of fully functionnal tree template.