What is the translation of " INTERNAL NODE " in Chinese?

• 内部节点
• 一个内部节点
• 个内部节点

Examples of using Internal node in English and their translations into Chinese

Therefore each internal node is at least half full.
因此，每一个内部节点都至少是半满的。

In the B+ tree, copies of the keys are stored in the internal nodes;
在B+树，这些键值的拷贝被存储在内部节点；.

Each internal node represents the test on the attribute.
每个内地的装满表示对属性的受考验。

The non-terminal nodes are the root node and the internal node.
非终结节点是根结点和内部节点。

Therefore, an internal node can have at most 2t children.
所以一个内结点至多可有2m个子女。

Since v‘ has h(v‘)gt; 0 it is an internal node.
因为v′{\displaystylev'}有h(v′{\displaystylev'})gt;0所以它是个内部节点。

Each internal node in a B-tree contains a number of keys.
B树的每个内部节点包含许多键。

A 3-ary tree is a tree in which every internal node has exactly 3 children.
所谓的四叉树是一棵有根的树，其中每个内部节点都有四个孩子。

For all internal nodes, the number of child pointers is always one more than the number of elements.
对于所有内部节点，子指针的数目总是比元素的数目多一个。

In order to maintain the pre-defined range, internal nodes may be joined or split.
为了维护预定义的范围，可以将内部节点加入或拆分。

Therefore, an internal node may have at most 2t children.
因此一个内部结点至多可有2t个孩子。

U must be either 2L or 2L- 1; therefore each internal node is at least half full.
U必须等于2L或者2L-1;因此，每一个内部节点都至少是半满的。

For example, if an internal node has 3 child nodes(or subtrees) then it must have 2 keys: a1 and a2.
例如，如果一个内部节点有3个子节点（子树），那么它就必须有两个键：a1和a2。

The subtree rooted at any node x contains at least 2bh(x)- 1 internal nodes.
以x为root的子树包含至少2^(bh(x))-1个内部node.

Deleting the key would make the internal node have d- 1{\displaystyle d-1} keys;
删除此键将导致此节点拥有d-1{\displaystyled-1}个键;

Since v′{\displaystyle v'} has h( v′{\displaystyle v'})gt; 0 it is an internal node.
因为v′{\displaystylev'}有h(v′{\displaystylev'})gt;0所以它是个内部节点。

The size of an internal node is the sum of sizes of its two children, plus one(size= size+ size+ 1).
一个内部结点的大小是它的两棵子树的大小，再加一（size=size+size+1）。

An octree is a tree data structure in which each internal node has exactly eight children.
八叉树（英语：octree）是一种树形数据结构，每个内部节点都正好有八个子节点。

Each element in an internal node acts as a separation value for two subtrees, therefore we need to find a replacement for separation.
内部节点中的每一个元素都作为分隔两颗子树的分隔值，因此我们需要重新划分。

A transmission from any device is routed through these internal nodes to specified destination device.
从任何一个设备的传输可以通过这些内部节点路由到指定的目的设备。

In a 2-3 B-tree, the internal nodes will store either one key(with two child nodes) or two keys(with three child nodes)..
在2-3B树中，内部节点将会存储1个键值（带有2个子节点）或2个键值（带有3个子节点）。

The root of a B+ Tree represents the whole range of values in the tree, where every internal node is a subinterval.
B+树的根表示树中所有的值范围，其中每个内部节点都是子区间。

B+ tree: copies of the keys are stored in the internal nodes while the keys and records are stored in leaves;
在B+树，这些键值的拷贝被存储在内部节点；键值和记录存储在叶子节点；.

Similarly, if an internal node and its neighbor each have d{\displaystyle d} keys, then a key may be deleted from the internal node by combining it with its neighbor.
相似地，如果一个内部节点和他的邻居两者都有d{\displaystyled}个键，那么将通过它与邻居的合并来删除一个键。

For example, in a 2-3 B-tree(often simply 2-3 tree), each internal node may have only 2 or 3 child nodes..
例如，在一个2-3B树（通常简称2-3树），每一个内部节点只能有2或3个子节点。

By maximizing the number of child nodes within each internal node, the height of the tree decreases, balancing occurs less often, and efficiency increases.
通过最大化在每个内部节点内的子节点的数目减少树的高度，平衡操作不经常发生，而且效率增加了。

The B* tree balances more neighboring internal nodes to keep the internal nodes more densely packed.
B*树分支出更多的内部邻居节点以保持内部节点更密集地填充。

In the narrow sense, a B-tree stores keys in its internal nodes but need not store those keys in the records at the leaves.
狭义上，一个Ｂ树在它内部节点中存储键值，但不需在叶子节点上存储这些键值的记录。