set enumeration tree 集合枚举树
complete enumeration tree 完全枚举树
enumeration of binary tree 二叉树的枚举
enumeration of tree structure 树结构的枚举
free tree enumeration 自由树枚举
Among these three categories a possible common subtree algorithm is presented based on the enumeration tree technique of data mining domain.
本文深入探讨了每类算法中的代表算法，其中根据数据挖掘中枚举树相关技术提出了一种可能的公共子树查找算法的思想。
A zipper's enumeration functions allow you to traverse the entire tree in depth-first order, as shown in Figure 11.
zippers的枚举函数允许您按照深度优先的顺序遍历整个树，如图11所示。
This article gives three algorithms for all permutations of 1 to N, analyzing the application of this problem in stack and enumeration of binary tree.
文章给出了1至N全排列问题的三种求解算法，分析了该问题在栈及二叉树计数中的应用。
应用推荐