Examples of using Binary search in English and their translations into Chinese
{-}
-
Political
-
Ecclesiastic
-
Programming
However, because binary search is hard to write and even harder to get right, you may decide it isn't worth it to add.
但是由于二分搜索难以编写，甚至更难把它写对，你也可以说把它加上是不值得的。Some common types of binary search trees include T-trees, AVL trees, Splay trees, Tango trees, Red-Black trees etc.
一些常见类型的二叉搜索树包括T树，AVL树，Splay树，Tango树，红黑树等。But since the id field is also sorted a binary search can be conducted requiring an average of log2 1000000= 19.93= 20 block accesses.
但由于id字段也被排序，因此可以进行二进制搜索，需要平均log21000000=19.93=20块访问。It can clearly be seen that the binary search is much faster than the linear search. .
到目前为止，我们可以得出结论，二分搜索肯定比线性搜索更快。Some of the more clever candidates think to sort the synonyms list, and then use binary search to determine if two words are synonyms.
一些比较聪明的候选人会考虑对同义词列表进行排序，然后使用二分查找来确定两个单词是否同义。Timsort checks B[0](which is 5) and using a binary search it looks for the correct location in A.
Timsort检查B[0]（值为5），并使用二进制搜索查找其A中的正确位置。In consequence, B-trees do not need re-balancing as frequently as other self_balancing binary search trees.
因此，B+树不需要象其他自平衡二叉查找树那样经常的重新平衡。Along with its close cousin binary search tree, it's also one of the most popular tree data structures.
和它的近亲二叉搜索树一样，它也是最流行的树数据结构之一。If a difference in parity is found then a binary search is performed to find and correct the error.
如果发现奇偶校验有差异，则执行二分搜索来查找和纠正错误。You must have seen a binary tree(or BT for short) at least once(the following is not a binary search tree).
你应该接触过二叉树（BT）至少一次（下面不是二分查找树）。After that, finding the right hash code in the bucket may be linear or it may be a binary search….
之后，在存储桶中找到正确的哈希码可能是线性的，也可能是二进制搜索….In consequence, B-trees do not need re-balancing as frequently as other self_balancing binary search trees.
因此，B+树不需要像其他自平衡二叉查找树那样经常的重新平衡。Here is the sample code to create a binary search tree or BST in Java, without using any third party library.
以下是使用Java创建二叉搜索树或BST的示例代码，不使用任何第三方库。That's important when doing a global optimization, but in this case you only care about how fast the binary search works.
这在进行全局优化时很重要，但在这种情况下，你只需要关心二分搜索的工作速度。Idx with other reads, then it will be clear that it is a binary search.
Idx的最后一次读取操作与其他读取操作进行比较，那么，就会发现这显然是在进行二进制搜索。This is what many Java programmer forget when they try to implement binary search tree with Generics.
这是许多Java程序员在尝试使用泛型实现二叉搜索树时容易忘记的。Your BSTree should already be doing a get operation that's similar to the binary search.
挑战练习你的BSTree应该已经有了一个get操作，类似于二分搜索。In this post, we are going to explore the different types of trees like a binary tree, binary search trees and how to implement them.
在这篇文章中，我们将探讨不同类型的树，如二叉树、二叉搜索树以及如何实现它们。You must have seen a binary tree(or BT for short) at least once(the following is not a binary search tree).
你应该至少看过一次二叉树（以下不是二叉搜索树）。Write a code to find out if a tree is a binary search tree.
编写一个函数，检查一棵树是不是二叉搜索树。
