| 1. | A discussion on the recursive program 二叉树后序遍历的非递归化算法讨论 |
| 2. | Indicates that you want all the end - points of this traversal 表示您想要该遍历的所有端点。 |
| 3. | An example of an implementation that does not perform a stack walk is 不执行堆栈遍历的实现的示例为 |
| 4. | Versa provides this operation in the form of a backward traversal Versa以向后遍历的形式提供这一操作。 |
| 5. | Backward traversals are in the form 向后遍历的形式是: |
| 6. | Average number of row versions in the version chains that are traversed 被遍历的版本链中的行版本平均数。 |
| 7. | The recursive and non - recursive algorithm of post - traversing binary tree 二叉树后序遍历的递归和非递归算法 |
| 8. | It stores all the cells found along the way that make up the word 它存储在生成那个单词时所遍历的所有细胞。 |
| 9. | In general , the set of 一般来说,这样遍历的一组 |
| 10. | You might need to change the elements of the collection in the middle of a traversal 可能需要在遍历的中途更改集合的元素。 |