binary search tree中文,binary search tree的意思,binary search tree翻译及用法

2025-08-10 22:55 浏览次数 5

binary search tree

英[ˈbaɪnəri: sə:tʃ tri:]美[ˈbaɪnəri sɚtʃ tri]

二叉查找树

二元搜索树

binary search tree 例句

英汉例句

  • in the above example, a simple hashmap or binary search tree could have easily solved the problem, but implementing one of these data structures in xsl would be inconvenient and unnecessary.

    在上面的示例中,如果使用一个简单的散列图(hashmap)或二进制搜索树就可以轻易地解决问题,但是用xsl实现一个这样的数据结构并不是很方便,并且是不必要的。

  • the highly balanced binary search tree is established in order to improve efficiency of the binary search tree and to shorten the average search tree.

    建立高度平衡的二叉搜索树是为了提高二叉搜索树的效率,减少树的平均搜索长度。

  • it maintains the free space in heap as nodes in a cartesian binary search tree format.

    它按照cartesian二分法检索树格式以节点的形式维护堆中的空閑空间。

  • some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.

    本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。

  • a binary search tree (bst) is a binary tree with the following properties

    二进制搜索树 (bst)是具有以下属性的二进制树

  • using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem.

    用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。

  • given a binary search tree (bst), find the lowest common ancestor (lca) of two given nodes in the bst.

    给定一棵二叉搜索树(bst),寻找bst中两个给定节点的最近公共祖先(lca)。

  • in this article, i will show you how to use the binary search tree to store data.

    在这篇文章中,我将告诉你如何使用二进制搜索树来存储数据。

  • in this paper, the study of random binary search tree is a random graph theories of a tree.

    本文所研究的随机二叉搜索树是随机图论二叉树的一种。

  • in the binary search tree version, each node usually stores a key/value pair. the tree is searched and ordered according to its keys.

    在二叉查找树中,每一个节点通常包含了一个键值对,树结构将会依照节点的键来进行查找和组织。

  • binary search tree pre-, in-, post-order traversal for given tree.

    二进制搜索树前,在-,邮政汇票遍历树。

相关热词