Translation of leaf node from English into Chinese
Noun
technology
- The algorithm processes each leaf node separately.算法分别处理每个叶节点。
Synonyms and analogies of leaf node in English
Examples of leaf node in a sentence
In a binary tree, a leaf node has no descendants.
Translations of "leaf node" in Context ordered by category and frequency
To insert a new element, search the tree to find the leaf node where the new element should be added.
要插入一个新的元素，首先搜索这棵树找到新元素应该被添加到的叶子节点。
If leaf node or not
是否是叶子节点
terminating the traversing at a leaf node where no descendent node exists.
在不存在后继节点的叶节点上终止遍历。
The loop contains a leaf node. It can only contain other Loops or Segments
循环包含叶节点。它只能包含其他循环或段
To prune the plant, cut the stem just above a leaf node.
修剪植物时，要在叶节的上方把茎剪断。
leaf node: Examples and translations in context
Note: we define a location in an expression as a leaf node in the syntax tree.
注意： 我们定义在表达式中位置为在这个语法树中的叶子节点。
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.
不能将叶子节点配置成主节点，因为它不能直接访问其非根服务器之外的所有其他节点。
In the situation where a B+ tree is nearly empty, it only contains one node, which is a leaf node.
在很多树数据结构的表示中，一个节点有可能只有一个子节点，而叶子节点包含数据。
When the element path is empty, the query uses the default element path: the first path to a leaf node collection.
当元素路径为空时，查询将使用默认元素路径：指向叶节点集合的第一个路径。
By changing the value of the description flag, you can include or exclude descendants at the specified level or distance, the children before or after the specified level or distance (until the leaf node), and the leaf children regardless of the specified level or distance.
通过更改说明标志的值，可以包括或排除位于指定级别或指定距离处的后代、位于指定级别或距离之前或之后（直到叶节点为止）的子成员以及位于任何级别或距离的叶子成员。
R+ trees differ from R trees in that: nodes are not guaranteed to be at least half filled, the entries of any internal node do not overlap, and an object ID may be stored in more than one leaf node.
R+树和R树的区别在于：R+树的节点并不保证至少填充一半，节点互不相交，并且指向同一个对象的标识符可能会存在于多个叶子节点中。
Hierarchical softmax uses a binary tree and constructs the loss function based on the path from the root node to the leaf node. The gradient computational overhead for each step in the training process is related to the logarithm of the dictionary size.
层序 softmax 使用了二叉树，并根据根节点到叶子节点的路径来构造损失函数。其训练中每一步的梯度计算开销与词典大小的对数相关。
Algorithmically described below: Choose a new separator (either the largest element in the left subtree or the smallest element in the right subtree), remove it from the leaf node it is in, and replace the element to be deleted with the new separator.
算法的描述如下： 选择一个新的分隔符（左子树中最大的元素或右子树中最小的元素），将它从叶子节点中移除，替换掉被删除的元素作为新的分隔值。
See also: