Am 20.01.2013 14:47, schrieb Michael Van Canneyt: >>> >>> ? Why not ? I see no difference with a list or collection ? >> >> A tree is something implementation specific while the fpc-stl is only >> about opaque data structures. E.g. the fpc-stl supports TSet: but the >> whole implementation is hidden. The user does not/need not to know how >> the set works internally. It could be a linked list, a tree, whatever. > > For me, a tree is a data structure, just like a set, list, collection, > queue, whatever.
A tree is an implementation detail. For example a set could be implemented using a tree. _______________________________________________ fpc-pascal maillist - fpc-pascal@lists.freepascal.org http://lists.freepascal.org/mailman/listinfo/fpc-pascal
