Examples of using Binary tree in English and their translations into Chinese
{-}
-
Political
-
Ecclesiastic
-
Programming
Another useful data structure that we can build using hash pointers is a binary tree.
我们可以使用哈希指针构建的另一个有用的数据结构是二叉树。That element must be the last index N for the same reason: To maintain the compact array= complete binary tree property.
这同样也是这个元素必须是最后一个元素N的原因：维持紧凑数组=完整二叉树性质。Anything which has two children and one parent node is a binary tree.
任何有两个子节点和一个父节点的东西都是二叉树。A common way to organize this data is to designate a large disk for a binary tree"farm.".
组织数据的一种常见方法是指定一个大型的磁盘二叉树”农场。Remember that in a binary tree there is one node at the root, two nodes in the next level, and four at the next.
记住在二叉树中，根上有一个节点，下一级有两个，再下一级有四个。We are given a binary tree with root node root, a target node target, and an integer value k.
给定一个二叉树（具有根结点root），一个目标结点target，和一个整数值K。We will show that the number of leaves in a full binary tree is one more than the number of interior nodes.
我们将证明在完全二叉树中叶子的数目比内部节点的数目多一个。You also may recall how most commonly a binary tree is represented(at least in textbooks).
你也许还记得最常见的一棵二叉树（至少在教科书中）的样子。A complete binary tree doesn't need to have the last level to be completely filled.
完整的二叉树不需要完全填充最后一级。You must have seen a binary tree(or BT for short) at least once(the following is not a binary search tree). .
你应该接触过二叉树（BT）至少一次（下面不是二分查找树）。Because the merkle tree is a binary tree, it needs an even number of leaf nodes.
因为梅克尔树是一棵二叉树，它需要偶数个叶子节点。More precisely a full complete binary tree of height H has 2H+1- 1 nodes.
高度为h的完全二叉树共有2h+1-1个节点。Given a binary tree, find the length of the longest consecutive sequence path.
描述给定一棵二叉树，找到最长连续序列路径的长度。Given a binary tree rooted at root, the depth of each node is the shortest distance to the root.
给定一个根为root的二叉树，每个结点的深度是它到根的最短距离。On the left, a binary tree is unbalanced after adding node 2 to it.
左图的二叉树在添加了节点“2”之后，是不平衡的。You also may recall how most commonly a binary tree is represented(at least in textbooks).
你也要想到一般最常见的二叉树是怎样表示的（至少在教科书上）。The integer represents the root's value and a pair of parenthesis contains a child binary tree with the same structure.
该整数表示根的值，而一对括号包含一个具有相同结构的子二叉树。Shannon-Fano coding does not always produce optimal codes due to the way it builds the binary tree from the bottom up.
Shannon-Fanocoding不总是能够产生最优的编码，主要是由于二叉树是自下而上构建的。In fact, it's a very special balanced binary tree, called a complete binary tree.
实际上，它是一个非常特殊的平衡二叉树，称为完整的二叉树。That is, the object files generated from a compile should be placed in a separate binary tree.
也就是说，从编译生成的对象文件应该放置在单独的二叉树中。
