一个结点 英语是什么意思 - 英语翻译

• node

在 中文 中使用 一个结点 的示例及其翻译为 英语

如果一个结点是红色的，那么它所有的孩子都是黑色的。
If a node is red, then its children are black.

其中每一个结点是一个独立的数据库系统。
Every node is a separate database system.

如果一棵树只有一个结点，它的深度为1。
If a binary tree has only one node, its depth is 1.

现在我们想知道是否有一个结点的值为52。
Now we want to know if we have a node based on value 52.

树的每个数据元素称为一个结点。
Each data in the tree is called a node.

树的每个数据元素称为一个结点。
Each data item in a tree is called a node.

任何一个关键字出现且只出现在一个结点中；.
Any keyword appears and only appears in one node.

一个结点可以有多于一个的双亲.
A child may have more than one parent.

如果一个结点是红的，那么它的两个儿子都是黑的。
If a node is red, then both its children are black.

如果一个结点是红的，则它的两个儿子都是黑的。
(4) If a node is red, then both its children are black.

如果一个结点是红的，那么它的俩个儿子都是黑的。
(4) If a node is red, then both its children are black.

当一个结点生成一个新块时，它会在网络上散布这个块。
When a node generates a new block, it broadcasts it to the network.

如果一个结点是红色的，则它的两个儿子节点都是黑色的。
(4) If a node is red, then both its children are black.

但是当一个结点经历一次碰撞时，它不必立刻重发该帧。
But when a node experiences a collision, it doesn't necessarily retransmit the frame right away.

这样，一个结点就能够引用其父结点，但不拥有其父结点。
This way, a node will be able to refer to its parent node, but does not own its parent.

如果一棵树只有一个结点，那么它的深度为1。
If a binary tree has only one node, its depth is 1.

这就叫做结点的度数，或者一个结点有的连接数目。
And this is called the"degree" of a node, or the number of connections that a node has.

一个结点的孩子指针数等于这个结点的keys数+1；.
Number of children of a node is equal to the number of keys in it plus 1.

一个结点的祖先是从根结点到该结点路径上所经过的所有结点。
The ancestors of a node are all the nodes along the path from the root to that node..

有且仅有一个结点没有前驱（父结点），该结点为树的根.
A stump only has roots going down; there is no ascent with a tree like this.

虚拟宇宙是各自独立的个体，原因是在任何时候一个结点对象都不能在超过一个的虚拟宇宙中存在。
Virtual universes are separate entities in that no node object may exist in more than one virtual universe at any one time.

我们定义一个结点在树中的访问代价为它的访问频度乘以它在树中的深度。
We define a node's access cost within the tree to be its access frequency multiplied by its depth.

一个结点的孩子指针数等于这个结点的keys数+1；.
Number of children of a node are equal to the number of keys in that node+ 1.

一个结点在树中的深度定义为它到树根的距离加1。
We define the depth of a node in the tree as its distance from the root node plus 1.

当我们要实现二叉树时，我们需要牢记的第一件事是它是一个结点集合。
The first thing we need to keep in mind when we implement a binary tree is that it is a collection of nodes.

你也可以把整个植物砍掉6到8英寸，至少有一个结点（叶子是），有两个嫩枝附着。
You also can cut the entire plant about 15 to 20 cm(6 to 8 inches) above ground, leaving at least one node with two young shoots intact.

TemplateNodeModelgetParentNode()：一个结点只有一个父结点(除非这个结点是结点树的根结点，这时方法返回null)。
TemplateNodeModel getParentNode(): A node has exactly 1 parent node, except if the node is root node of the tree, in which case the method returns null.

Nodenext;//记录下一个结点.
ListNode next;// Pointer to the next node in the list.}.