这两个函数均按照深度优先的顺序遍历树，但两者的差异在于先访问一个节点还是先访问其子节点。
Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.
如果既没有指定过滤器又没有指定比较器，枚举将以未定义的顺序遍历记录存储中的所有记录。
If neither the filter nor the comparator are specified, the enumeration will traverse all records in the record store in an undefined order.
在某些情况下，我们实际可能希望按照相反的顺序遍历这些节点、跳过某些节点或子树或其他一些内容。
In some cases, we may actually want to traverse these nodes in the reverse order, skip certain nodes or subtrees, or something else.
应用推荐