Leaves in a red-black tree contain no information, but internal nodes represent one or more tasks that are runnable.
红黑树的叶子不包含信息，但是内部节点代表一个或多个可运行的任务。
Through storing the path of internal nodes, LSEQ enhanced querying efficiency and avoided structure-joining.
LSEQ编码通过记录非叶节点的路径，在节点查询中避免了结构连接操作，提高了查询效率。
B + tree consists of a root, internal nodes and leaves. The root may be either a leaf or a node with two or more children.
树由根，内部节点和叶组成。根可以是叶或具有两个或更多个子节点的节点。
The research emphasizes on the feature selection in internal-nodes, and designs a new Distance Difference Function.
论文重点研究了决策树内部结点的特征选择方法，设计了一个新的距离差函数。
The research emphasizes on the feature selection in internal-nodes, and designs a new Distance Difference Function.
论文重点研究了决策树内部结点的特征选择方法，设计了一个新的距离差函数。
应用推荐