二进制搜索树(BST)是具有以下属性的二进制树。
A binary search tree (BST) is a binary tree with the following properties.
在二进制树，你必须计算在一个自底向上的方式，极大。
In the binary tree, you have to compute the maxima in a bottom-up manner.
这是一个简单的二进制树类，我在写一写掌上电脑程序。
This is a simple binary tree class that I wrote while writing a PDA program.
例如，您可以为一个二进制树建立类型Node两个指针指向左右子节点。
As an example, you will model a class node for a binary tree, with 2 Pointers to the left and right child nodes.
但你需要使用一个二进制树，我会把(指数，值)在二树和关键指标。
But given you need to use a binary tree, I would store (index, value) in the binary tree and key on index.
设计了二进制树型拓扑结构传播统一的系统时钟和触发信号，采用CPLD提供传感器间的精确时序和同步。
A binary tree routing topology is designed for propagating the system clock and trigger signal and the accurate timing and synchronization between sensors are provided by CPLD.
在评论中已经讨论的，使事情变得简单，你可以添加条目到阵列使其大小两个电源，所以二进制树的所有的叶子，相同的深度。
As already discussed in the comments, to make things simple, you can add entries to the array to make its size a power of two, so the binary tree has the same depth for all leaves.
针对多标签的碰撞问题，本文重点介绍和讨论基于TDMA的两类主流的标签防碰撞算法：基于ALOHA的标签防碰撞算法和基于二进制树的标签防碰撞算法。
For this multi-label collisions problem, this paper focuses on describing two kinds of main label anti-collision algorithm based on TDMA, ALOHA algorithm and binary tree.
在上面的示例中，如果使用一个简单的散列图(hashmap)或二进制搜索树就可以轻易地解决问题，但是用XSL实现一个这样的数据结构并不是很方便，并且是不必要的。
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.
没有循环依赖，二进制文件，库，文档，构建，第三方的代码都组织进合适的文件夹内。源码树的物理布局与逻辑层次、组织方式相匹配。
No circular dependencies, binaries, libs, docs, builds, third-party code all organized into appropriate folders Physical layout of source tree matches logical hierarchy and organization.
通常，该命令将Samba 安装到 /usr/local目录树，这是本地编译的二进制文件的常用位置。
Typically, this command installs Samba to the /usr/local directory tree, which is the usual location for locally compiled binaries.
在这篇文章中，我将告诉你如何使用二进制搜索树来存储数据。
In this article, I will show you how to use the Binary Search Tree to store data.
二进制搜索或者搜索速度更快，使用前缀树吗？
二进制搜索的财产是左树的每一个节点，每个节点是小右大。
Binary Search property is every node on left tree is lesser and every node on right is greater.
对于这一类的问题你可以使用数据结构知道treap(随机二进制搜索树)。
For this type of problem you can use Data Structure know as TREAP (Randomized Binary Search Tree).
在对二进制搜索算法及其各种改进算法分析的基础上，提出了基于冲突树的标签自适应防碰撞算法(act)。
The elementary binary search algorithm and some improved algorithms were analyzed, and an adaptive anti-collision algorithm based on collision-tree (ACT) was proposed.
二进制搜索树前，在-，邮政汇票遍历树。
Binary Search tree pre -, in -, post-order traversal for given tree.
也许同样重要的是基本的算法，如二进制搜索，图形搜索算法，排序算法，并基于树的极小搜索。
Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
一些聪明的算法可能会发现最接近的匹配速度快，像四叉树或二进制空间分割。
Some clever algorithms might find the closest match faster, like quadtrees or binary space partitioning.
一些聪明的算法可能会发现最接近的匹配速度快，像四叉树或二进制空间分割。
Some clever algorithms might find the closest match faster, like quadtrees or binary space partitioning.
应用推荐