Advertising
Register for free: access more results and features
leaf node
Definition
Translation of "leaf node" in Chinese
Definition NEW
叶子节点
叶节点
叶节
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.
在不存在后继节点的叶节点上终止遍历。
Alternatively, an event in one component may update the visual representation of another component; for example, clicking on a leaf node in a tree may cause an associated list to change its contents and redisplay.
另外，某个组件的事件可能会更新另一个组件的显示；例如当点击一个树型控件的叶节点可能会导致和它关联的列表控件改变它的内容和显示。
To prune the plant, cut the stem just above a leaf node.
修剪植物时，要在叶节的上方把茎剪断。
When you take cuttings, make sure to include at least one leaf node.
剪插条的时候，要确保带上至少一个叶节。
When a leaf node is reached, the contained bounding boxes (rectangles) are tested against the search rectangle and their objects (if there are any) are put into the result set if they lie within the search rectangle.
如果搜索到一个叶子节点，则尝试比较搜索框与它的外接矩形和数据（如果有的话 ） ， 如果该叶子节点在搜索框中，则把它加入搜索结果。
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.
算法的描述如下： 选择一个新的分隔符（左子树中最大的元素或右子树中最小的元素），将它从叶子节点中移除，替换掉被删除的元素作为新的分隔值。
Selecting this option could affect existing custom field values. Any custom field value for ^0 will be deleted if it is not set to a leaf node, the lowest level subordinate value. Do you want to continue?
选择此选项会影响现有自定义域的值。若未设置为 叶节点 （最低级别的附属值），则任何自定义域的 ^0 值都将被删除。 是否继续？
Searching is quite similar to searching in a B+ tree. The search starts from the root node of the tree. Every internal node contains a set of rectangles and pointers to the corresponding child node and every leaf node contains the rectangles of spatial objects (the pointer to some spatial object can be there).
搜索算法和B+树 类似，从根节点开始，每个非叶子节点包含一系列外接矩形和指向对应子节点的指针，而叶子节点则包含空间对象的外接矩形以及这些空间对象（或者指向它们的指针 ） 。
For example, nodes are searched from a root node to leaf nodes in a process of traversing a B-tree index, whereas, when an index split occurs, the split may spread from a leaf node to a parent node, resulting in a dead lock.
例如，在平衡树索引遍历过程中从根节点到叶节点搜索节点，但是，发生索引分裂时，分裂可能会从叶节点扩散到父节点，造成锁死。
Synonyms and analogies of "leaf node" in English
Word & Expression of the day
Image of the day
Suggestions that contain leaf node
Results: 36. Exact: 36. Elapsed time: 17 ms.
