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

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.

youdao

实验结果表明，相对于其他一些搜索方法，ENESPS能有效缩短平均搜索长度，并明显减少色彩量化所需的计算时间。

Experiment results show that ENESPS can obtain shorter averaged searching length in comparison with other methods and it can reduce the computational time of color quantization remarkably.

youdao

实验结果表明，相对于其他一些搜索方法，ENESPS能有效缩短平均搜索长度，并明显减少色彩量化所需的计算时间。

Experiment results show that ENESPS can obtain shorter averaged searching length in comparison with other methods and it can reduce the computational time of col...

youdao

So when I do the analysis, I want to think about what am I doing here, am I capturing all the pieces of it? Here, the two variables that matter are what's the length of the list, and how many times I'm going to search it?

这里，要关注的,两个变量是列表,的长度以及我要搜索的次数,这种情况下，这个算法赢了？

麻省理工公开课 - 计算机科学及编程导论课程节选