这个调用将（以对数时间）遍历树，查找最靠近树根节点的电影公司电影汇总。

This will traverse the tree (in logarithmic time) and find the closest to the root node's summation of studio movies.

youdao

假定我的应用程序中的数据都来自于数据库表中存储的各种值，我想让数据模型知道怎样对数据进行查找、排序、遍历和修改。

I wanted to make an assumption that the data in my application was just values from a table. I wanted my data model to know how to search, sort, traverse and modify that data.

youdao

在其他的应用程序中，如果查找session中的对象失败，则会产生对数据源的另一个请求。

In other applications, a failure to locate an object in session simply results in another request to the data source.

youdao

Right? If that was the case in that code, then my complexity is no longer log, because I need linear access for each time I've got to go to the list, and it's going to Lisp be much worse than that.

这里的复杂度不再是对数的了，因为每次在列表中，查找需要线性访问,可能还要糟糕,其实，有些编程语言，如。

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