go top 返回词典
• Red-black tree is a self-balancing binary search tree.

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

youdao

• Implement an iterator over a binary search tree (BST).

实现一个二叉搜索(BST)的迭代器。

youdao

• Difference between binary search and binary search tree?

搜索二叉搜索之间差异

youdao

• Two elements of a binary search tree (BST) are swapped by mistake.

归并跟划分树一对好基

youdao

• Binary Search tree pre -, in -, post-order traversal for given tree.

二进制搜索-邮政汇票遍历树。

youdao

• A binary search tree (BST) is a binary tree with the following properties.

二进制搜索(BST)具有以下属性的二进制树。

youdao

• The results show that it is more effective than the binary search tree.

结果表明查找更为有效

youdao

• It maintains the free space in heap as nodes in a Cartesian binary search tree format.

按照Cartesian二分法检索格式节点的形式维护中的空闲空间

youdao

• In this article, I will show you how to use the Binary Search Tree to store data.

篇文章中，告诉如何使用二进制搜索存储数据

youdao

• The second chapter is devoted to the basic knowledge of map and random binary search tree.

第二章介绍随机二叉搜索基本知识

youdao

• In this paper, the study of random binary search tree is a random graph theories of a tree.

本文研究随机搜索随机二叉树的一种

youdao

• For this type of problem you can use Data Structure know as TREAP (Randomized Binary Search Tree).

对于一类问题可以使用数据结构知道treap(随机二进制搜索)。

youdao

• The B-tree is a generalization of a binary search tree in that a node can have more than two children.

二叉搜索泛化，其节点可以具有多于两个节点。

youdao

• Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.

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

youdao

• Identifying the child nodes is important when we consider a more specific type of binary tree-the binary search tree.

我们考虑一种具体叉树——二叉搜索树时，识别结点很重要的。

youdao

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

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

youdao

• 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.

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

youdao

• 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.

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

youdao

• 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实现这样数据结构并不是很方便，并且是不必要的。

youdao

• 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.

其它提供了最坏情况Ologn查找时间自平衡二分查找不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外开销

youdao

• 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.

这些年间有许多种不同数据结构不断提出应用例如哈希二分搜索数字查找树、三元搜索树等等。

youdao

• Binary Search property is every node on left tree is lesser and every node on right is greater.

二进制搜索财产一个节点每个节点是

youdao

• This paper presents a fast exhaustive search algorithm in order to search the protein conformation space based on the lattice model by constructing a directional binary tree.

本文构造具有方向导向性的完全二叉树的基础，提出了一种适合研究蛋白质构象格子模型快速穷举搜索算法

youdao

• The algorithm takes advantage of the theories of bidirectional search, projection, minimum Angle and binary tree.

算法基于双向式搜索原理采用投影法夹角最小方法二叉理论。

youdao

• Which search is faster, binary search or using prefix tree?

二进制搜索或者搜索速度更快，使用前缀树吗？

youdao

• The thesis sets up binary tree data structure of train route, and research train route automatic arrangement search arithmetic.

本文建立列车二叉数据结构对列车进路自动排定搜索算法进行了研究探讨

youdao

• Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.

也许同样重要的是基本算法二进制搜索图形搜索算法，排序算法，基于树极小搜索。

youdao

• 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)。

youdao

• 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)。

youdao

\$firstVoiceSent
- 来自原声例句