A BINARY SEARCH TREE 中文是什么意思 - 中文翻译

• 二叉搜索树
• 二叉查找树

在 英语 中使用 A binary search tree 的示例及其翻译为 中文

A Binary Search Tree.
进制搜索树.

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

A Binary Search Tree.
一叉搜索树.

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

Red-Black Tree is a binary search tree in which every node is colored either red or black.
红黑树是一类特殊的二叉搜索树，其中每个结点被染成红色或黑色。

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

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

How do you find the second largest element in a Binary Search Tree?
如何在一个二进制搜索树中找到第二大element？?

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

Write a code to find out if a tree is a binary search tree.
编写一个函数，检查一棵树是不是二叉搜索树。

Here is the sample code to create a binary search tree or BST in Java, without using any third party library.
以下是使用Java创建二叉搜索树或BST的示例代码，不使用任何第三方库。

You should convince yourself that the resulting tree is still a binary search tree.
你需要保证该树仍然是一棵二叉查找树。

A red-black tree is a binary search tree in which each node is colored red or black such that.
红黑树是一类特殊的二叉搜索树，其中每个结点被染成红色或黑色。

You should convince yourself that the resulting tree is still a binary search tree.
你应该保证处理之后的树仍是二叉查找树。

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

You must have seen a binary tree(or BT for short) at least once(the following is not a binary search tree).
你应该至少看过一次二叉树（以下不是二叉搜索树）。

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

You must have seen a binary tree(or BT for short) at least once(the following is not a binary search tree).
你应该接触过二叉树（BT）至少一次（下面不是二分查找树）。

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

With the implementation of a binary search tree now complete, we will do a quick analysis of the methods we have implemented.
通过二叉搜索树实现的完成，我们将对我们已经实现的方法进行一个快速的分析。

Let's look at an artificial yet valuable example and try to answer the“why” question,“Why use a binary search tree in the first place”.
让我们看一个人工但有价值的示例，并尝试回答“为什么”问题，“为什么首先使用二叉搜索树”。

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

In addition to the requirements imposed on a binary search tree the following must be satisfied by a red- black tree: Each node is either red or black.
在二叉查找树强制一般要求以外，对于任何有效的红黑树我们增加了如下的额外要求：节点是红色或黑色。

An AVL tree implements the Map abstract data type just like a regular binary search tree, the only difference is in how the tree performs.
AVL树实现抽象数据类型Map就像一个普通的二叉搜索树，唯一不同的是这棵树的工作方式。

Our Binary Search Tree.
搜索我们叉树.

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

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

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

What is the difference between B tree and Binary search tree?
小可：B树？这个B树和二叉搜索树有什么区别呢？?