Introduction - If you have any usage issues, please Google them yourself
Delphi: Delphi tree traversal can be modified into a multi-tree, Delphi source code download, the node containing the class definitions, the definition of a binary tree class, the program will use a recursive way to find a node, the node after the current node add, delete nodes, to determine whether a node to the end node, and defines the exception class for exception handling. When you add a node, the node should ensure uniqueness, when traversing the node is a data conditions. While this example only implements a binary tree node to add, delete, but also consider the case of multi-tree, as long as the modifications ChildNode type, you can implement a multi-tree.