Delphi:Delphi遍历二叉树，可修改成多叉树，Delphi源码下载，内含定义节点类，定义二叉树类，程序将利用递归方式查找节点，在当前节点之后添加节点，删除节点，判断某一节点是否为尾节点，并定义了异常类，用于异常错误处理。在添加节点时，应保证节点的唯一性，在遍历节点时是以数据为条件的。本实例虽然只实现了二叉树节点的添加、删除，但也考虑了多叉树的情况，只要修改ChildNode类型，便可以实现一个多叉树。

-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.