The payload is then passed in as is (binary data) to the compute node you will create shortly.
然后，负载被按原样(二进制数据)传递给稍后将创建的计算节点。
These groups are used during installation to ensure servers that perform storage node roles receive specific binary files and configuration files, which are detailed below.
这两个组在安装过程中用来确保执行存储节点角色的服务器可以接收特定的二进制文件和配置文件，这在下面会详细进行介绍。
Each CDATA section, comment, processing instruction, and non-leaf node is assigned a binary codeword.
每个CDATA部分、注释、处理指令和非叶节点都被分配一个二进制代码字。
Ensure the message type is Binary Large Object "BLOB" to prevent the node from parsing the payload of the incoming message from the REST client.
确保消息类型为BinaryLargeObject“BLOB”，以阻止节点从REST客户端解析进入消息的负载。
This node type represents images and other binary content in a JCRWiki entry.
这个节点类型表示JCRWiki条目中的图片和其他二进制内容。
As an example, you will model a class node for a binary tree, with 2 Pointers to the left and right child nodes.
例如，您可以为一个二进制树建立类型Node两个指针指向左右子节点。
The following figure shows that the request is then forwarded to a Compute node to do the transformation of the incoming request from SOAP to binary.
下面的图显示该请求接着被转发到一个Compute节点，以将进入的请求从soap转换成二进制。
Next, it analyzed various kinds of data structure of BOM and chose binary tree as the data structure to save BOM, and realize duty decomposition from the core enterprise to the node enterprise.
其次，将BOM的各种数据结构进行分析，选择了二叉树表示型的数据结构来存储bom，同时利用二叉树型的BOM实现从核心企业到节点企业的任务分解。
With a little more effort, I can express a binary tree — a tree with each node holding a value and exactly two branches. A simple binary tree in Haskell looks like this.
只要多付出一点功夫，就能表达b树——b树的每个节点都容纳一个值和两个分支。
Starting with a ground structure, we use binary number combinatorial algorithm to generate a number of topologies, which are a sequence of substructures with different node distributions.
从原始结构着手，通过使用二进制组合算法来产生一系列具有不同节点分布的子结构，即拓扑组。
Binary Search property is every node on left tree is lesser and every node on right is greater.
二进制搜索的财产是左树的每一个节点，每个节点是小右大。
In our arithmetic expressions we could have used inheritance to get from a unary to a binary operator node, but that would substantially violate the test.
在我们的四则运算表达式里面我们可以利用继承实行从一元到二元操作符的表示，但它实质上会干扰测试。
In this problem each node of a binary tree contains a positive integer and all binary trees have have fewer than 256 nodes.
在这个问题中，二叉树的每个节都值都为正整数，且每棵树的节点数都小于256。
The B-tree is a generalization of a binary search tree in that a node can have more than two children.
树是二叉搜索树的泛化，其节点可以具有多于两个的子节点。
A binary tree is a collection of nodes in which each node contains two links, one to its left child and another to its right child.
一个二叉树是一系列节点的集合，每一个节点都包含有两个子节点，一个称之为左节点，而另一个称之为右节点。
How many binary trees can find that haven Node and the height of these tress are n-3?
有多少二叉树可以发现有n个节点和这些枝条的n - 3的高度吗？
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
对于这个问题，一个高度平衡的二叉树是指每个节点的两个子节点的深度的差异都不超过1的二叉树。
A binary tree is defined as a tree where each node can have no more than two children.
树中的结点最多有两个子结点的树叫做二叉树。
Please enter the binary tree using an array of node data, in order to create a structure array representation of binary tree, when completed, will structure the contents of the output array.
请使用数组输入二叉树的结点数据，以结构体数组表示法创建二叉树，完成后将结构数组内容输出。
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
题目大意：给定一棵二叉树，请判断该二叉树是否是平衡二叉树。 所谓平衡二叉树就是每个节点的两颗子树深度不超过1。
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
二叉树平衡的条件是左子树平衡且右子树平衡且左右子树的高度相差最多为1。基于这个思路递归处理。
The binary format only supports one text node as the attribute value and therefore buffers the values written to it to emit a single node, as shown in the following sample code.
二进位格式仅支援一个当做属性值的文字节点，因此会缓冲处理写入至其中的值来发出单一节点，如下列范例程序码所示。
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
应用推荐