全部

1·For example, a leaf node knows itself and its parent.

例如，一个叶节点知道它自身及其父节点。

2·The XPath for a computed value should be a leaf node only.

计算出的值的XPath只能是叶节点。

3·Eventually, the algorithm reaches a leaf node with the final classification.

最终，算法抵达的叶子节点就是最终分类。

4·Each CDATA section, comment, processing instruction, and non-leaf node is assigned a binary codeword.

每个CDATA部分、注释、处理指令和非叶节点都被分配一个二进制代码字。

5·The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

所谓的深度就是指从根节点到最远的叶节点之间的距离。

6·The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

最小深度是指从根节点出发到达最近的叶子节点所需要经过的节点个数。

7·For information on how to remove a leaf node or entire node subtree from a document, see Removing Nodes from the DOM.

有关如何从文档中移除叶节点或整个节点子树的信息，请参见从DOM中移除节点。

8·In an HDBMS like the one illustrated above, the only way to discover this would be an extremely costly search of every book leaf node.

在上面举例说明的HDBMS中，找到答案的唯一方法是搜索每个书籍叶节点，而这样做的成本极其高。

9·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.

不能将叶子节点配置成主节点，因为它不能直接访问其非根服务器之外的所有其他节点。

10·Note: If you are connected to a non-root node or a leaf node, the information that you can view and the actions that you can take are limited.

注意：如果您连接到非根节点或叶节点，您可以查看的信息和可以采取的操作将受到限制。