Implement an iterator over a binary search tree (BST).
实现一个二叉搜索树(BST)的迭代器。
Which search is faster, binary search or using prefix tree?
二进制搜索或者搜索速度更快，使用前缀树吗？
Binary Search tree pre -, in -, post-order traversal for given tree.
二进制搜索树前，在-，邮政汇票遍历树。
A binary search tree (BST) is a binary tree with the following properties.
二进制搜索树(BST)是具有以下属性的二进制树。
In this article, I will show you how to use the Binary Search Tree to store data.
在这篇文章中，我将告诉你如何使用二进制搜索树来存储数据。
It maintains the free space in heap as nodes in a Cartesian binary search tree format.
它按照Cartesian二分法检索树格式以节点的形式维护堆中的空闲空间。
OK. At the end of the lecture last time, I also showed you an example of binary search.
好的，在上次课程的最后，我也给你们看了一个二分查找的例子。
The second chapter is devoted to the basic knowledge of map and random binary search tree.
第二章介绍了图和随机二叉搜索树的基本知识。
In this paper, the study of random binary search tree is a random graph theories of a tree.
本文所研究的随机二叉搜索树是随机图论二叉树的一种。
This paper proposes a scheme of certificate revocation management based on binary search trees.
提出了一种基于二叉搜索树的证书撤消管理方案。
Binary Search property is every node on left tree is lesser and every node on right is greater.
二进制搜索的财产是左树的每一个节点，每个节点是小右大。
For this type of problem you can use Data Structure know as TREAP (Randomized Binary Search Tree).
对于这一类的问题你可以使用数据结构知道treap(随机二进制搜索树)。
The B-tree is a generalization of a binary search tree in that a node can have more than two children.
树是二叉搜索树的泛化，其节点可以具有多于两个的子节点。
Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.
添加和删除操作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。
And, of course, they asked new university graduates about computer science theory; "Write me a binary search."
当然，他们也问刚毕业的大学生一些关于计算机科学理论的问题，如：请写一个二分查找程序。
Now, one of the questions we could still ask is, right, we've got binary search, which has got this nice log behavior.
目前，还有一个问题我们仍然要问的是，对，我们已经学了二分查找，有着非常好的log级别的行为。
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转换器使用二进制搜索方法来确定模拟输入电压的数字等效。
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)。
The identification of the binary search algorithm is more efficient. This algorithm exposes information and has poor security.
二进制搜索算法虽然识别效率比较高，但是泄露信息比较多，安全性比较差。
Aiming at these problems, this paper presents a binary search algorithm based on solving the maximum module of roots of polynomial.
针对该问题，提出一种基于多项式根的最大模求解的二分搜索算法。
Binary search function template and test procedures, it can find ways to implement binary search, the party returns-1 lookup failed!
二分查找函数模板及测试程序，它能实现查找方式中的二分查找，党查找失败时返回- 1 ！
Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.
本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。
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.
用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。
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.
建立高度平衡的二叉搜索树是为了提高二叉搜索树的效率，减少树的平均搜索长度。
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.
算法也同样重要，从二分查找到各种排序，到图形遍历，一位明星工程师必须知道并内在消化这些基础东西。
This was using something called a bisection method, which is related to something called binary search, which we'll see lots more of later, to find square roots.
你应该想起来，我们是以一个，叫做二分法求平方根的问题结束的，它运用了二分法去求一个数的平方根，二分法和我们将要花很多时间。
Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
也许同样重要的是基本的算法，如二进制搜索，图形搜索算法，排序算法，并基于树的极小搜索。
Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
也许同样重要的是基本的算法，如二进制搜索，图形搜索算法，排序算法，并基于树的极小搜索。
应用推荐