Engels

Arabisch Catalaans Chinees Deens Duits Engels Frans Grieks Hebreeuws Hindi Hongaars Italiaans Japans Koreaans Nederlands Oekraïens Perzisch Pools Portugees Roemeens Russisch Slowaaks Spaans Thai Tsjechisch Turks Vietnamees Zweeds

Chinees

Definitie Arabisch Catalaans Chinees Deens Duits Engels Frans Grieks Hebreeuws Hindi Hongaars Italiaans Japans Koreaans Nederlands Oekraïens Perzisch Pools Portugees Roemeens Russisch Slowaaks Spaans Thai Tsjechisch Turks Vietnamees Zweeds

Favorieten

Publiciteit

binary search

Definitie

method to find a value in a sorted array ... See more

Vertaling van "binary search" in Chinees

Definitie

NEW

二叉查找

二分搜索

二叉搜索

二分查找

二元搜尋

However, they work well in practice, and the randomized balancing scheme has been argued to be easier to implement than the deterministic balancing schemes used in balanced binary search trees.

但是在实际中它通常工作良好，随机化平衡方案也比平衡二叉查找树等数据结构中使用的确定性平衡方案容易实现。

Unlike a binary search tree, no node in the tree stores the key associated with that node; instead, its position in the tree defines the key with which it is associated.

与二叉查找树不同，键不是直接保存在节点中，而是由节点在树中的位置决定。

Algorithms taking logarithmic time are commonly found in operations on binary trees or when using binary search.

常见的具有对数时间的算法有二叉树的相关操作和二分搜索 。

If a difference in parity is found then a binary search is performed to find and correct the error.

如果发现奇偶校验有差异，则执行二分搜索来查找和纠正错误。

With the switched capacitor circuit running, the iDAC uses a binary search to determine the value at which the voltage on the bus remains constant.

当开关电容器电路运行时，iDAC 使用二叉搜索确定使总线电压保持恒定的电压值。

Objects also give users the opportunity to create even more specialized data structures. With it, one can design their own List, Binary Search Tree, Heap, Splay Tree, Graph, Disjoint Set, and any host of other options.

对象还让用户有机会创建更专门化的数据结构。有了它，一个人可以设计自己的列表、二叉搜索树、堆、散列树、图、不相交集、以及其他选择。

Although specialized data structures designed for fast searching, such as hash tables, can be searched more efficiently, binary search applies to a wider range of problems.

尽管特定的、为了快速搜索而设计的数据结构更有效（比如哈希表），二分搜索应用面更广。

In a regular binary search tree when deleting a node with two non-leaf children, we find either the maximum element in its left subtree (which is the in-order predecessor) or the minimum element in its right subtree (which is the in-order successor) and move its value into the node being deleted (as shown here).

对于二叉查找树，在删除带有两个非叶子儿子的节点的时候，我们找到要么在它的左子树中的最大元素、要么在它的右子树中的最小元素，并把它的值转移到要删除的节点中（如在这里所展示的那样）。

In computer science, an AVL tree is a self-balancing binary search tree.

平衡树是计算机科学中的一类改进的二叉查找树。

Editing Self-balancing binary search tree (section)

（重定向自自平衡二叉查找树）

Binary search operations (on sorted ranges)

二分搜索操作（在已排序范围上）

Binary search trees are a fundamental data structure used to construct more abstract data structures such as sets, multisets, and associative arrays.

二叉查找树是基础性数据结构，用于构建更为抽象的数据结构，如集合、多重集、关联数组等。

Binary search trees are a fundamental data structure used to construct more abstract data structures such as sets, multisets, and associative arrays. Some of their disadvantages are as follows

树图广泛应用于计算机科学的数据结构中，比如二叉查找树，堆，Trie树以及数据压缩中的霍夫曼树等等。