binary search tree是什么意思_binary search tree的中文翻译

二元搜索树

二叉查找树

binary search───[计]对分查找；二进位检索；折半查找法；二分搜寻；二进位检索; 对半检索; 对分检索; 折半查找

binary tree───[计]二叉树；二进制树形网络

binary───adj.[数]二进制的；二元的，二态的

binary heap───[计]二进制堆

binary code───[计]二进制代码；二进制码

binary relation───n.[数]二元关系

search───v.搜索，搜寻；调查，搜查；搜身；探求；思索;（在计算机上）搜索；n.搜寻；探究，查究；检索；n.(Search)（印、美）瑟奇（人名）

binary digit───[数][计]二进制数字，[数][计]二进制位；二进制位，二进制数字; 二进制码

binary converter───二进制转换器；单级换流器

binary search tree (BST) is a binary tree with the following properties.───二进制搜索树(BST)是具有以下属性的二进制树。

Red-black tree is a self-balancing binary search tree.───红黑树 是一个自平衡的二叉查找树。

Binary Search tree pre -, in -, post-order traversal for given tree.───二进制搜索树前，在-，邮政汇票遍历树。

Binary tree is often used as a binary search tree and binary heap.───二叉树常被用作二叉查找树和二叉堆。

First, the elements are inserted into a binary search tree.───最初要素被二进制的寻找树插入。

A binary search tree is not an attractive approach to sorting because a heap does the same job with less effort.───因为累积由于更少的努力做相同的工作所以二进制的寻找树由于有魅力到分类接近不。

In this paper, the study of random binary search tree is a random graph theories of a tree.───本文所研究的随机二叉搜索树是随机图论二叉树的一种。

It maintains the free space in heap as nodes in a Cartesian binary search tree format.───它按照Cartesian二分法检索树格式以节点的形式维护堆中的空闲空间。

AVL tree is the first invention of the self-balancing binary search tree.───AVL树是最先发明的自平衡二叉查找树。

Simple binary search tree, but there is a problem: it is not a balanced tree.

This is an implementation of the Binary Search Tree algorithm.

First, the elements are inserted into a binary search tree.

Red-black tree is a self-balancing binary search tree.

To learn the representation and implementation of a binary search tree.

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.

Binary search tree sample source code integrity, and can be used directly.

This is known as a random binary search tree.