A binary search tree (BST) is a binary tree with the following properties.
二进制搜索树(BST)是具有以下属性的二进制树。
OK. At the end of the lecture last time, I also showed you an example of binary search.
好的，在上次课程的最后，我也给你们看了一个二分查找的例子。
And, of course, they asked new university graduates about computer science theory; "Write me a binary search."
当然，他们也问刚毕业的大学生一些关于计算机科学理论的问题，如：请写一个二分查找程序。
In the above example, a simple hashmap or binary search tree could have easily solved the problem, but implementing one of these data structures in XSL would be inconvenient and unnecessary.
在上面的示例中，如果使用一个简单的散列图(hashmap)或二进制搜索树就可以轻易地解决问题，但是用XSL实现一个这样的数据结构并不是很方便，并且是不必要的。
Implement an iterator over a binary search tree (BST).
实现一个二叉搜索树(BST)的迭代器。
The second chapter is devoted to the basic knowledge of map and random binary search tree.
第二章介绍了图和随机二叉搜索树的基本知识。
This paper proposes a scheme of certificate revocation management based on binary search trees.
提出了一种基于二叉搜索树的证书撤消管理方案。
The B-tree is a generalization of a binary search tree in that a node can have more than two children.
树是二叉搜索树的泛化，其节点可以具有多于两个的子节点。
Identifying the child nodes is important when we consider a more specific type of binary tree-the binary search tree.
当我们考虑一种更具体的二叉树——二叉搜索树时，识别子结点是很重要的。
Thus a prior art SAR converter USES a binary search method to determine a digital equivalent of the analog input voltage.
因此，现有技术的SAR转换器使用二进制搜索方法来确定模拟输入电压的数字等效。
Aiming at these problems, this paper presents a binary search algorithm based on solving the maximum module of roots of polynomial.
针对该问题，提出一种基于多项式根的最大模求解的二分搜索算法。
Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.
本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。
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.
建立高度平衡的二叉搜索树是为了提高二叉搜索树的效率，减少树的平均搜索长度。
The elementary binary search algorithm and some im - proved algorithms are compared and analyzed quantified in detail, and a novel improved algorithm is proposed.
在对基本二进制搜索算法及其各种改进算法进行详细的定量分析的基础上提出了一种改进算法。
The elementary binary search algorithm and some improved algorithms were analyzed, and an adaptive anti-collision algorithm based on collision-tree (ACT) was proposed.
在对二进制搜索算法及其各种改进算法分析的基础上，提出了基于冲突树的标签自适应防碰撞算法(act)。
At the same time, recoverable dynamic binary search algorithm can narrow the scope of the search tag, thus greatly reducing communication time and data between reader and tags.
返回式二进制搜索算法可以缩小标签搜索范围，从而大大减少阅读器与标签之间的通信时间和传输的数据量。
The technique of TDMA can solve this problem. In TDMA, there are several anti - collision algorithms, such as ALOHA, Slotted ALOHA, binary search, dynamic binary search and so on.
解决这个问题可以采用时分多路存取技术，其相关的算法有aloha法、时隙aloha法、二进制搜索法、动态二进制搜索法等防碰撞算法。
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）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
Throughout the years, many kinds of data structure had been proposed and applied, for instance, hash tables, binary search tree, digital search tree, ternary search tree and so on and so forth.
在这些年间，有许多种不同的数据结构不断被提出和应用，例如哈希表、二分搜索树、数字查找树、三元搜索树等等。
Because the words are in alphabetical order, we can speed things up with a bisection search (also known as binary search), which is similar to what you do when you look a word up in the dictionary.
我们知道这些单词是按照字母表顺序组织的，所以我们可以加速一下，用一种对折搜索（也叫做二元搜索），这个过程就和你在现实中用字典来查单词差不多。
In this article, I will show you how to use the Binary Search Tree to store data.
在这篇文章中，我将告诉你如何使用二进制搜索树来存储数据。
Finally, a new approach for cutter path calculation using binary-search technique is presented, which will simplify the CNC programming problems to a great extent.
最后提出一种采用对分试算法计算刀具轨迹的新方法，可简化数控编程计算问题。
Finally, a new approach for cutter path calculation using binary-search technique is presented, which will simplify the CNC programming problems to a great extent.
最后提出一种采用对分试算法计算刀具轨迹的新方法，可简化数控编程计算问题。
应用推荐