片语

binary y search method对分检栓

Binary hash search二分哈希查找

binary tree search二叉树检索

binary y search tree对分检索

database binary table search数据库二元表搜寻

binary y search二分查找

binary harmony search二进制和声搜索

英汉例句

• the highly balanced binary search tree is established in order to improve efficiency of the binary search tree and to shorten the average search tree.

  建立高度平衡的二叉搜索树是为了提高二叉搜索树的效率，减少树的平均搜索长度。

• binary search property is every node on left tree is lesser and every node on right is greater.

  二进制搜索的财产是左树的每一个节点，每个节点是小右大。

• the elementary binary search algorithm and some im- proved algorithms are compared and analyzed quantified in detail, and a novel improved algorithm is proposed.

  在对基本二进制搜索算法及其各种改进算法进行详细的定量分析的基础上提出了一种改进算法。

• using this notation, you should know that search through a list is o(n) and binary search (through a sorted list) is log(n).

  看到这个标记你就应该知道搜索链表的复杂度为o(n)，进行二进制搜索时（已排序）的空间复杂度为log(n)。

• some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.

  本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。

• if the order of the nodes in the trees is the same as that of binary search trees, then it is the better form of binary search trees.

  如果其各结点在树中的次序（位置）与排序二叉树相一致，则它是一种较好形式的查找二叉树。

• and the algorithms are just as important - from binary search to different sorts to graph traversals, a rockstar engineer must know and internalize the basics.

  算法也同样重要，从二分查找到各种排序，到图形遍历，一位明星工程师必须知道并内在消化这些基础东西。

• in this article, i will show you how to use the binary search tree to store data.

  在这篇文章中，我将告诉你如何使用二进制搜索树来存储数据。

• this idea of binary search is going to be a really powerful tool.

  二分查找的思想,是一个非常有用的工具,我重复一遍，把问题拆成几部分来解决,那事实上，这里的增长率是多少？

• this paper proposes a scheme of certificate revocation management based on binary search trees.

  提出了一种基于二叉搜索树的证书撤消管理方案。

• based on the analysis of binary search method, a new search method is put forward.

  在分析二分搜索方法基础上，提出了一种新的搜索方法。

• binary search is perhaps the simplest of the divide and conquer algorithms, and what does that mean?

  好了，二分搜索也许是,最简单的分治算法，这意味着什么？

• at least wide receivers have to run, whereas i can guarantee you, without fear of contradiction, that no software engineer will ever have to write a binary search after they are hired.

  因为至少接球员是需要跑的，而我却可以无所畏惧的向你保证，没有哪个被聘用的软件工程师必须写一个二分查找程序。

• add and remove operations are typically expensive since binary search trees require that a tree be balanced.

  添加和删除操作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。

• using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem.

  用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。

• red-black tree is a self-balancing binary search tree.

  红黑树是一个自平衡的二叉查找树。