二叉搜索和二叉搜索树之间的差异？
实现一个二叉搜索树(BST)的迭代器。
第二章介绍了图和随机二叉搜索树的基本知识。
The second chapter is devoted to the basic knowledge of map and random binary search tree.
提出了一种基于二叉搜索树的证书撤消管理方案。
This paper proposes a scheme of certificate revocation management based on binary search trees.
本文所研究的随机二叉搜索树是随机图论二叉树的一种。
In this paper, the study of random binary search tree is a random graph theories of a tree.
树是二叉搜索树的泛化，其节点可以具有多于两个的子节点。
The B-tree is a generalization of a binary search tree in that a node can have more than two children.
给定一个升序排列的有序单链表，将其转换为一棵平衡的二叉搜索树。
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。
Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.
当我们考虑一种更具体的二叉树——二叉搜索树时，识别子结点是很重要的。
Identifying the child nodes is important when we consider a more specific type of binary tree-the binary search tree.
用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。
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.
建立高度平衡的二叉搜索树是为了提高二叉搜索树的效率，减少树的平均搜索长度。
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.
增强的JFS2在执行索引节点搜索时使用二叉树表示形式，与JFS使用的线性方法相比，这种方法要好得多。
Enhanced JFS2 USES a binary tree representation while performing inode searches, which is a much better method than the linear method used by JFS.
算法基于双向式搜索原理，采用投影法、夹角最小的方法及二叉树理论。
The algorithm takes advantage of the theories of bidirectional search, projection, minimum Angle and binary tree.
本文建立了列车进路的二叉树数据结构，并对列车进路自动排定搜索算法进行了研究探讨。
The thesis sets up binary tree data structure of train route, and research train route automatic arrangement search arithmetic.
本文在构造具有方向导向性的完全二叉树的基础上，提出了一种适合研究蛋白质构象的格子模型快速穷举搜索算法。
This paper presents a fast exhaustive search algorithm in order to search the protein conformation space based on the lattice model by constructing a directional binary tree.
新算法生成的线索二叉树比传统的线索二叉树优越，从而使WBS搜索更加简单、有效。
The threaded binary tree based on the new algorithm is superior to the traditional one, and thus makes the WBS searching simpler and more effectual.
在此基础上，提出了采用虚拟矩阵匹配搜索二叉树以确定领域式规划空间中邻接关系的方法，并描述了启发式方法和概率方法相结合的路径搜索算法。
And then associating with the virtual array elements, this article improves the algorithm and an improved space-time virtual DOA array method has been made.
在此基础上，提出了采用虚拟矩阵匹配搜索二叉树以确定领域式规划空间中邻接关系的方法，并描述了启发式方法和概率方法相结合的路径搜索算法。
And then associating with the virtual array elements, this article improves the algorithm and an improved space-time virtual DOA array method has been made.
应用推荐