二叉搜索和二叉搜索树之间的差异？
实现一个二叉搜索树(BST)的迭代器。
二进制搜索树(BST)是具有以下属性的二进制树。
A binary search tree (BST) is a binary tree with the following properties.
同时，还推导了机器人路径搜索树网格算法。
The gridding arithmetic of search tree of robotic path is derived.
第二章介绍了图和随机二叉搜索树的基本知识。
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.
正则搜索树的分支因数对算法的复杂度有决定性影响。
The branching factor of a regular search tree has a decisive effect on the time complexity of a search algorithm.
本文所研究的随机二叉搜索树是随机图论二叉树的一种。
In this paper, the study of random binary search tree is a random graph theories of a tree.
强连通分量形成了搜索树，他们的根就是强连通分量的根。
The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components.
在典型的参数算法中，有界搜索树和动态规划是常用技术。
Bounded search tree and dynamic programming are frequently-used techniques in parameterized algorithm.
树是二叉搜索树的泛化，其节点可以具有多于两个的子节点。
The B-tree is a generalization of a binary search tree in that a node can have more than two children.
该算法从理论上提供了减小搜索树的规模及运行时间的可能性。
The algorithm provides the possibility of reducing the size of the search tree and running time.
当从一个搜索树返回时，判断该点是否是一个强连通分量的根。
When the search returns from a subtree, the nodes are taken from the stack and it is determined whether each node is the root of a strongly connected component.
在这篇文章中，我将告诉你如何使用二进制搜索树来存储数据。
In this article, I will show you how to use the Binary Search Tree to store data.
给定一个升序排列的有序单链表，将其转换为一棵平衡的二叉搜索树。
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
解决博弈问题的传统算法——搜索树法所无法克服的对搜索深度的限制。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
Transformer搜索树中的匹配项，在该点更改树，并返回该点。
Transformer searches for a match in the tree, mutates the tree at that point, and returns it.
摘要解决博弈问题的传统演算法搜索树法所无法克服的对搜索深度的限制。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
当我们考虑一种更具体的二叉树——二叉搜索树时，识别子结点是很重要的。
Identifying the child nodes is important when we consider a more specific type of binary tree-the binary search tree.
第一是基于人工势场的方法，第二是快速随机搜索树和滚动规划的结合方法。
The first method is based on the artificial potential field. And the second one is suggested by Rapidly-exploring Random Tree (RRT) and rolling windows planning.
使用人工智能中搜索树的方法构造了一种利用计算机求解24点游戏解的算法。
An algorithm on solving 24-point game based on AI searching tree is constructed in this paper.
对于这一类的问题你可以使用数据结构知道treap(随机二进制搜索树)。
For this type of problem you can use Data Structure know as TREAP (Randomized 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.
对B&B算法的研究集中在化简搜索树从而降低搜索复杂度上，提出了几种改进的B&B算法。
The previous research on B&B algorithm focused on simplifying the search tree in order to reduce the search complexity, and several improvements have already existed.
本文提出一种用于区域表达的数据结构——数字搜索树(DST)及其线性化编码(LDST)。
In this paper, we put forward a region representation data structure-digital search tree (DST) and its lineal encoding (LDST).
针对虚拟设计中的方案树搜索树问题提出一种新的优化模型，并结合人工神经网络技术加以解决。
This paper presents an optimization model of virtual design for project search tree problem, which can be solved by using the characteristic artificial neural net.
搜索树中的每个节点并与释放的节点进行比较，如果释放的节点的地址与任何其他节点相邻，它就与那个节点合并。
Each node in the tree is searched in comparison to the node being freed, and if it adjoins any other node in terms of the address, it is joined to that node.
搜索树的每一节点对应一个RCPSP，通过求解各节点rcps P来求得rl P的最优调度计划。
Every node in search tree corresponds a RCPSP, and the RCPSP is solved to obtain schedule for the RLP.
在这些年间，有许多种不同的数据结构不断被提出和应用，例如哈希表、二分搜索树、数字查找树、三元搜索树等等。
Throughout the years, many kinds of data structure had been proposed and applied, for instance, hash tables, binary search tree, digital search tree, ternary search tree and so on and so forth.
应用推荐