大家都搜：
二叉查找树
二元搜索树
1、cherry trees───樱桃树
2、binary digit───[数][计]二进制数字，[数][计]二进制位；二进制位，二进制数字; 二进制码
3、binary───adj.[数]二进制的；二元的，二态的
4、binary relation───n.[数]二元关系
5、binary code───[计]二进制代码；二进制码
6、trees───n.树木；[植]乔木；[化学]树状结构（tree的复数）；n.(Trees)人名；(德)特雷斯；(英)特里斯
7、binary heap───[计]二进制堆
8、binary search───[计]对分查找；二进位检索；折半查找法；二分搜寻；二进位检索; 对半检索; 对分检索; 折半查找
9、search───v.搜索，搜寻；调查，搜查；搜身；探求；思索;（在计算机上）搜索；n.搜寻；探究，查究；检索；n.(Search)（印、美）瑟奇（人名）
1、Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.───通常需要增加和删除Cao作，因为二叉树需要被平衡。
2、Simple Binary Tree Class - Binary Search Trees are useful for finding items in a list that changes infrequently .───二叉搜索树在查找经常变化的列表时是很非常有用的。
3、An Incremental Fuzzy Decision Tree Classification Method for Data Streams Mining Based on Threaded Binary Search Trees───一种高效的数据流挖掘增量模糊决策树分类算法
4、This paper proposes a scheme of certificate revocation management based on binary search trees.───提出了一种基于二叉搜索树的证书撤消管理方案。
5、Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.───添加和删除Cao作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。
6、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.───和其它的提供了最坏情况O（log n） 查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
7、Binary Search Trees are useful for finding items in a list that changes infrequently.───对半查找树对于找到在一个列表中很少变化的项来说是很有用的。
1、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.