Search - Binary Tree

Search - Binary Tree - List

[Delphi VCL] 实习五二叉树的存储与遍历 DL : 0: 二叉树的存储与遍历-binary tree traversal and storage
Date : 2008-10-13 Size : 4.79kb User : vvho
[Delphi VCL] RangeEncoding_dpr DL : 0: 区间编码算法的分析与实现(项目文件) 摘要：全面介绍了区间编码算法的理论基础和实现方式。详细讨论了区间编码原理、正规化操作、区间编码实现、二进制索引树的理论和实现等技术。并给出了一个切实可行的应用程序。-Range encoding algorithm analysis and implementation (project file) Abstract: The comprehensive range encoding algorithm theoretical basis and implementation. Discussed in detail a range of coding theory, standardized operation, interval coding, binary index tree theory and implementation of technologies such as. And gives a practical application.
Date : 2025-12-19 Size : 271kb User : 叶
[Delphi VCL] 59687345 DL : 0: Delphi遍历二叉树源代码，编程学习源码，很好的参考资料。-Delphi binary tree traversal two source code, learning programming source code, a good reference.
Date : 2025-12-19 Size : 100kb User : 什锦丁儿
[Delphi VCL] Delphi_727451 DL : 0: 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.
Date : 2025-12-19 Size : 62kb User : IV5X15O