Documents are displayed as leaf nodes.
文档显示为叶节点。
Best practice: Create stores at leaf nodes in the organizational hierarchy.
最佳实践：在组织层次结构的叶节点创建商店。
Enable users to submit consolidation nodes, even if not all leaf nodes have been opened.
允许用户提交合并结点，即使并非所有的叶子节点都已打开。
The keys of the message map are strings that represent XPath expressions to access the leaf nodes of the business object.
消息映射的键是字符串，表示用于访问业务对象的叶子节点的XPath表达式。
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就必须执行越多的读取来获取索引叶子节点，并且就将花更多的时间来获得真正的数据。
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.
在应用层组播中，如果出现非叶子节点失效或离开，则该节点的所有下游节点都将受到很大的影响。
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.
若能把铁线莲种植得足够深，深到能使两组叶子(或叶节点)在土表以下，你就等于给加了它一份保险。
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.
如果两个商店在逻辑上相关联(如上面的示例，商店通过地域相关联)，则可以引入一个中间节点，但是，要保持商店为叶节点。
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.
用新的属性选择标准生成的决策树一般具有叶子数目较少，叶子的平均深度也较小，且叶子具有较强的泛化能力。
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节点。
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节点。
应用推荐