tree traversing 树遍历
binary tree traversing 二叉树遍历
Traversing Binary Tree 二叉树的遍历 ; 遍历二叉树
double order for traversing tree 遍历树的双重次序
traversing binary tree algorithm 二叉树遍历算法
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.
这种在解析期间修改文档结构的做法可以使 DOM 树占用更少的内存，而且还可以减少在内存中遍历和修改文档时所花的时间。
Traversing the JSF component tree recursively.
递归式遍历 JSF 组件树。
Traversing that tree, you will eventually find the JIT code buffer (also commonly known as the code cache).
通过树，你最后会找到JIT代码缓冲。
应用推荐