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.