At Revelytix, we always traverse the nodes in the depth-first order of the zipper enumeration.
在Revelytix中，我们始终按照zippers枚举深度优先的顺序遍历节点。
A zipper's enumeration functions allow you to traverse the entire tree in depth-first order, as shown in Figure 11.
zippers的枚举函数允许您按照深度优先的顺序遍历整个树，如图11所示。
A zipper's enumeration functions allow you to traverse the entire tree in depth-first order, as shown in Figure 11.
zippers的枚举函数允许您按照深度优先的顺序遍历整个树，如图11所示。
应用推荐