Documents are displayed as leaf nodes.
文档显示为叶节点。
Best practice: Create stores at leaf nodes in the organizational hierarchy.
最佳实践：在组织层次结构的叶节点创建商店。
Is the depth how many leaf nodes 5's entirely two fork tree have after all?
深度为5的满二叉树到底有多少个叶子节点？
Enable users to submit consolidation nodes, even if not all leaf nodes have been opened.
允许用户提交合并结点，即使并非所有的叶子节点都已打开。
Up to the designated leaf nodes, and then traverse the process of marking the existence of a 0, 1 code array.
直到到指定的叶子结点，然后将遍历过程中标记的0,1代码存在一个数组中。
The keys of the message map are strings that represent XPath expressions to access the leaf nodes of the business object.
消息映射的键是字符串，表示用于访问业务对象的叶子节点的XPath表达式。
PQT for representing binary images can reduce a number of leaf nodes, so it can save storage and speed up operations.
PQT表示二值图像可以减少大量叶结点，从而达到节省存储空间、加快运算的目的。
In Application Layer Multicast (ALM), if none-leaf nodes leave or fail, all of this node's download nodes will be greatly affected.
在应用层组播中，如果出现非叶子节点失效或离开，则该节点的所有下游节点都将受到很大的影响。
The EMF level deltas (individual changes), shown at the leaf nodes, are conveniently grouped into composite deltas at the UML level.
这个EMF层级deltas （单个的变更），显示在叶节点，可以在UML 层级很方便地归到复核的 deltas 中。
This algorithm establish transaction-tree which is based on transaction database create frequent itemsetby backdate reversely from leaf nodes.
此算法主要利用事务数据库建立事务树的方法，由叶子结点反向回溯，导出频繁集。
The information source nodes take the inherent connection among information processing nodes as the leaf nodes of layer structure and connect them.
信息源节点则按其与信息处理节点的固有连接作为层次结构的叶子节点进行连接。
When you plant clematis deep enough to put two sets of leaves (or leaf nodes) under the surface of the soil, you give the plant an insurance policy.
若能把铁线莲种植得足够深，深到能使两组叶子(或叶节点)在土表以下，你就等于给加了它一份保险。
The more index levels, the more reads Informix Dynamic Server must perform to get to index leaf nodes, and the more time it will take to get to the real data.
索引层次越多，InformixDynamicServer就必须执行越多的读取来获取索引叶子节点，并且就将花更多的时间来获得真正的数据。
It is a finite, labeled, directed tree in which the internal nodes are labeled by operators, and the leaf nodes represent the operands of the node operators.
这是一个有限、已标记、导向的树状结构，其中的内部节点会标示运算子，而分叶节点则代表节点运算子的运算元。
But moving backward is more complicated, because internally the iterator performs a depth-first, preorder traversal of the Rope, visiting each of its leaf nodes.
但是向后移动要复杂些，因为迭代器内部执行的是深度优先算法，预先排好了Rope遍历的顺序，需要访问每个叶节点。
In this example, we will disable all non-leaf nodes, because it is common that non-leaf nodes are just used for categorizing the items that you want to perform tasks on.
在本示例中，我们将禁用所有的非叶节点，因为通常非叶节点只用来对希望对其执行任务的那些项进行分类。
If two stores are logically related (as in our example above, where the stores were related by region), then introduce an intermediate node, but keep the stores as leaf nodes.
如果两个商店在逻辑上相关联(如上面的示例，商店通过地域相关联)，则可以引入一个中间节点，但是，要保持商店为叶节点。
The quick but incorrect way to remedy the problem would be to eliminate the Leaf class and represent Leaf nodes simply by putting null Pointers in the left and right fields of a Branch.
一种快速但不正确的解决这个问题的方法是除去Leaf类并通过简单地将空指针放在Branch的left和right字段中来表示leaf节点。
Results flow from the bottom of the run tree (leaf nodes) to the top (XTree node) where the result is represented in RSAPI (Resultset API) format and can be sent to the report service for rendering.
结果从运行树（叶子节点）流到顶部（XTree节点），其中结果以 RSAPI (ResultsetAPI)格式表示，且可被发送到报表服务以供呈现。
The decision tree constructed with the new standard of attribute selection has the following characteristics: fewer leaf nodes, fewer levels of average depth, better generalization of leaf nodes.
用新的属性选择标准生成的决策树一般具有叶子数目较少，叶子的平均深度也较小，且叶子具有较强的泛化能力。
You cannot configure a leaf node as the master node because it does not have direct access to all the nodes other than its non-root server.
不能将叶子节点配置成主节点，因为它不能直接访问其非根服务器之外的所有其他节点。
Every simple path from a node to a descendant leaf contains the same number of black nodes.
从节点到后代叶节点的所有简单路径都包含相同的黑节点数。
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.
树由根，内部节点和叶组成。根可以是叶或具有两个或更多个子节点的节点。
For information on how to remove a leaf node or entire node subtree from a document, see Removing Nodes from the DOM.
有关如何从文档中移除叶节点或整个节点子树的信息，请参见从DOM中移除节点。
In the network model, Nodes change between the three roles: root node, branch node and leaf node, to organize and maintain the network tree structure.
在该网络模型中节点在三种角色之间变化：根节点，分支节点和叶子节点，来组织和维护树型网络结构。
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
最小深度是指从根节点出发到达最近的叶子节点所需要经过的节点个数。
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
所谓的深度就是指从根节点到最远的叶节点之间的距离。
Histochemical analysis and in situ hybridization showed that the ACO1 expression was localized in the basal parts of leaf sheaths immediately above nodes or the lower parts of elongating internodes.
组织化学分析和原位杂交结果表明ACO1在伸长中的节间底部仅靠近节的叶鞘基部表达量很高。
Histochemical analysis and in situ hybridization showed that the ACO1 expression was localized in the basal parts of leaf sheaths immediately above nodes or the lower parts of elongating internodes.
组织化学分析和原位杂交结果表明ACO1在伸长中的节间底部仅靠近节的叶鞘基部表达量很高。
应用推荐