The books node at the top of the tree has two child book tags.
树顶部的books节点有两个book子标记。
This line visits the AST tree, starting at the compilation unit (the top-most node), and queries for a list of all method declarations.
这一行访问ast树，起步于编辑单元(最顶层的节点)，并且查询所有的方法声明。
Results flow from the bottom of the run tree (leaf nodes) to the top (XTree node) where the result is represented in RSAPI (Resultset API) format and can be sent to the report service for rendering.
结果从运行树（叶子节点）流到顶部（XTree节点），其中结果以 RSAPI (ResultsetAPI)格式表示，且可被发送到报表服务以供呈现。
The existing majority of the decision tree inductions are based on a top-down greedy algorithm, which make a locally optimal decision at each node.
目前存在的决策树归纳算法大多数是基于自顶向下的贪婪算法，它在每个结点都执行一个局部最优决策。
The existing majority of the decision tree inductions are based on a top-down greedy algorithm, which make a locally optimal decision at each node.
目前存在的决策树归纳算法大多数是基于自顶向下的贪婪算法，它在每个结点都执行一个局部最优决策。
应用推荐