What is the translation of " BINARY SEARCH " in Chinese?

• 二叉搜索
• 二分搜索
• binary search
• 二进制搜索
• 二分查
• 自叉查找

Examples of using Binary search in English and their translations into Chinese

A Binary Search Tree.
进制搜索树.

Next comes the binary search.
接下来我们谈谈BinarySearch。

Binary search tree node class c++.
BinarySearchTree二叉搜索树C++.

It's not a binary search tree.
因此这不是一棵二叉搜索树。

Binary search trees(BST) keep their keys in sorted order.
二叉搜索树（BST）按序储存他们的关键字。

Then we think about binary search.
接下来我们谈谈BinarySearch。

The binary search tree and B-tree data structures are based on binary search..
二叉搜索树和B树数据结构就是基于二分查找算法的。

Let's talk about the binary search.
接下来我们谈谈BinarySearch。

The binary search tree and B-tree data structures are based on binary search.
二分搜索树和B树数据结构就是基于二分搜索的。

It's a variation of binary search.
这题其实就是binarysearch的变形。

A binary search tree or BST is a popular data structure which is used to keep elements in order.
二叉搜索树或BST是一种流行的数据结构，用于保持元素的顺序。

Both subtrees are also binary search trees.
所有的子树也都是二叉搜索树。

The reasoning for this is exactly the same as the one we used when analyzing the complexity of binary search.
这个推理跟我们分析二分搜索算法的复杂度时用到的完全一样。

All subtrees must be binary search trees too.
所有子树自身必须也是二叉搜索树。

For a binary search, the best case is O(1), meaning the item of your search is located at the midpoint.
对于二分搜索，最好的情况也是O(1)，此时搜索的元素位于中点。

This is because a binary search is used(very fast).
这是因为使用二进制搜索(很快)。

The typical solution for that is to use a binary search tree.
典型的解决方案是使用一个二叉搜索树。

In order to calculate the size of a binary search tree, it's necessary to visit each node in the tree.
为了计算二叉搜索树的大小，必须要访问树中的每个节点。

In the previous section we looked at building a binary search tree.
在上一节中我们讨论了建立一个二叉搜索树。

The B-tree is a generalization of a binary search tree in that a node can have more than two children.
B-tree是二叉搜索树的推广，一个节点可以有两个以上的子节点。

It's a self-balancing variant of the binary search tree.
它是二叉搜索树（BinarySearchTree）的一种自平衡变体。

Now let's look at how a Binary Search Tree will help us to reach to the required node using least number of steps.
现在让我们看看二进制搜索树如何帮助我们使用最少的步骤访问所需的节点。

The AVI tree is a self-balancing binary search tree.
AVL树是一颗自平衡的二叉搜索树。

Operation of Binary Tree and Binary Search Tree- Binary tree can be anything that has two children and one parent.
手术的二叉树和二进制搜索树-二叉树可以是任何有两个孩子和一个父母的东西。

Two binary sort tree(Binary Sort Tree) is also called the two binary search tree.
二叉排序树(BinarySortTree)又称二叉查找(搜索)树(BinarySearchTree)。

In addition to the ordinary requirements imposed on binary search trees, the following additional requirements apply to red-black trees.
在二叉搜索树的要求之外，红黑树增加了如下的额外要求：.

This kind of search where we reduce the search space into half at each comparison is called binary search.
这种“每次将搜索范围缩小一半”的思想称为折半查找（BinarySearch）。

We will discuss binary tree or binary search tree specifically.
我们将要具体地讨论二叉树或二叉搜索树。

Let's say we want to store all Netflix movies in a binary search tree with movie titles as sort keys.
假设我们要将所有Netflix电影存储在二进制搜索树中，并将电影标题作为排序键。

The most important expectation for a BST is that it satisfies the binary search property(that's where the name comes from).
对BST最大的期望是能够满足二分搜索的特性（这也是它的名字来源）。