一个条目树是一个重量级的对象，需要花时间去构建，并且它是一个您必须使用xml解析器才能解析的结构。
An item tree is a heavyweight object that takes time to build, and it is a structure you have to use an XML parser on.
尽管第一个长出木本的植物体积很小，但接下来的其他植物种群便能够因此迅速从木本结构优势种获利，仅仅几百万年的时间，其中一些具有木本的植物便进化得像现在的树一样了。
Although the first plants sporting wood were small, subsequent species quickly took advantage of wood's structural strength: in just a few million years, some had attained treelike stature.
这种在解析期间修改文档结构的做法可以使 DOM树占用更少的内存，而且还可以减少在内存中遍历和修改文档时所花的时间。
Such modifications of the document structure during parsing can result in a smaller memory footprint for the DOM tree, and also reduce the time spent traversing a document and modifying it in memory.
但是我们能在可容忍的空间使用增加上，进一步提高它的时间效率吗？我们需要分析三元搜素树的算法与结构。
But can we make it more efficient in time with a tolerable space increment? We need to analyse the algorithm and the data structure of ternary search tree.
索引树的结构决定了平均访问索引节点的数目，但是即使对于相同的索引结构，如果采用不同的广播序列，则平均访问时间也不尽相同。
The structure of the index tree decides the average index number to be visited, but even regarding the same index structure, the average visit time is different if the broadcast sequence is different.
研究了基于一种新二叉树结构的二叉排序树的生成算法，并在此算法的基础上进行时间复杂度分析。
This paper is devoted to a study of an algorithm of generating the binary-sort-tree on the new structure and, on the basis of this algorithm, an analysis is made of the time complexity.
它的结构简单，但可以在线性的时间里解决许多复杂的问题，被大量的使用在字符串及树的模式匹配中。
Despite their simple data structure, many complicated problems can be solved in linear time with suffix trees. So they are intensively employed in pattern matching on string and trees.
它的结构简单，但可以在线性的时间里解决许多复杂的问题，被大量的使用在字符串及树的模式匹配中。
Despite their simple data structure, many complicated problems can be solved in linear time with suffix trees. So they are intensively employed in pattern matching on string and trees.
应用推荐