Thank you.< /p>
You can only use two base objects: TNode and TNodeList (for example, TObjectList descendants). At least, TNode only needs three members: your string data, a reference to its parent node (or nil if the node is root), and TNodeList, which is a list of its child nodes. The rest are various accompanying The implementation of methods (a bit cumbersome), such as Add(), Delete(), IndexOf(), MoveTo(), GetFirstChild(), GetNext(), etc. The basic tree should be less than one-nighter.
I am looking for a non-visual persistent tree (TStringTree) implementation. If anyone knows any good implementation, please let me know.
Thank you.
You will find a flexible non-visual tree structure in the DI Containers library (commercial). But, as others mentioned above, it’s easy to roll yourself, Only add the functions you need.
You can only use two basic objects: TNode and TNodeList (for example, TObjectList descendants). At least, TNode only needs three members: your string data, A reference to its parent node (nil if the node is root), and TNodeList, which is a list of its child nodes. The rest is the implementation of various accompanying methods (a bit cumbersome), such as Add(), Delete( ), IndexOf(), MoveTo(), GetFirstChild(), GetNext(), etc. The basic tree should be less than one-nighter.