Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.
这两个函数均按照深度优先的顺序遍历树,但两者的差异在于先访问一个节点还是先访问其子节点。
In other words, instead of going depth-first (to the children), it goes through the adjacent elements.
换句话说,它没有选择深度优先(到达子代),而是遍历相邻元素。
In the Search Depth field, select the "Search only direct children of a path" option.
在Search depth字段中,选择“Search only direct children of a path”选项。
应用推荐