Traducere vocală, funcționalități offline, sinonime, conjugare, jocuri educative
Publicitate
Înregistrează-te gratuit: mai multe rezultate și funcții
non-leaf node
Traducere "non-leaf node" în chineză
非叶子节点
The company's tree is the consolidated report management structure for the current main organization. Moreover, only a non-leaf node can be selected, indicating that the parent can consolidate for the subordinate.
单位的待选树是当前主组织所截取的合并报表管理结构小树，并且只可以选择其中的非叶子节点，表示上级可以替下级做合并。
For each Non-Leaf node, i.e. a Sub Group in a Consolidation Structure, a unit needs to be consolidation range is the unit itself and its direct child. It is called Level-by-Level Consolidation if it also has child that needs to be consolidated by using the consolidated result data of its direct child.
对于一个合并结构中的每个非叶子节点即子集团来说，它就是需要进行合并的单位，其合并范围是它本身及直接下级单位，如果它的直接下级还有下级，那就是我们常说的逐级合并模式，需要用直接下级已经合并的结果数据进行合并。
Each consolidated report management structure tree has a defined scope and mode of non-leaf node is a company to be default, this company and its subordinate units will be one of its direct subordinate unit has further subordinate units, this is known as cascade this time, the system uses the results which have been consolidated by the direct subordinate unit by default.
每棵合并报表管理结构是确定了合并范围和合并模式的，对于每个非叶子节点来说，它就是一个需要进行合并的单位，其合并范围系统默认的就是它本身及直接下级单位，如果它的直接下级还有下级，那就是我们常说的逐级合并，这时候系统默认为需要用直接下级已经合并的结果数据。
Alte rezultate
Therefore, the root is best defined as the non-leaf, non-nodes bearing parts of the plant's body.
当然，位于地表外的气生根（榕树）也属于根的一种。
In B-trees, internal ([[Leaf node|non-leaf]]) nodes can have a variable number of child nodes within some pre-defined range.
在B树中，内部（非叶子）节点可以拥有可变数量的子节点（数量范围预先定义好 ） 。
Click CompanyVO from the left tree, then the right panel is editable. Note: only by clicking the non-leaf sub-nodes can the right panel be editable.
点中左边树上的CompanyVO，右边面板才能变得可编辑，注意，只有点击非叶子节点时候，右边才能变得可编辑。
"Cannot set"{0}" because only unique attributes or unique non attributed leaf nodes can be set."
无法设置"｛0｝"，因为只能设置唯一属性或唯一非属性化叶节点。
We then delete the node we copied the value from, which must have fewer than two non-leaf children.
我们接着删除我们从中复制出值的那个节点，它必定有少于两个非叶子的儿子。
In a regular binary search tree when deleting a node with two non-leaf children, we find either the maximum element in its left subtree (which is the in-order predecessor) or the minimum element in its right subtree (which is the in-order successor) and move its value into the node being deleted (as shown here).
对于二叉查找树，在删除带有两个非叶子儿子的节点的时候，我们找到要么在它的左子树中的最大元素、要么在它的右子树中的最小元素，并把它的值转移到要删除的节点中（如在这里 所展示的那样 ） 。
Treci la Premium pentru a debloca milioane de exemple de traduceri, a salva și învăța vocabular nelimitat, fără reclame.
Sinonime și analogii pentru "non-leaf node" în limba Română
Cuvântul și expresia zilei
Imaginea zilei
Rezultate: 9. Exacte: 3. Timp de răspuns: 16 ms.
