/// Returns iterator for depth-first pre-order tree traversal
Returns iterator for depth-first pre-order tree traversal
Returns iterator for depth - first pre - order tree traversal
pub fn iter_depth_first_preorder<'a>(
    &'a self,
  ) -> DftPre<'a, AuspiceTreeNode, AuspiceTreeNodeIterFn<'a>, AuspiceTreeNodeIter<'a>> {
    DftPre::new(&self.tree, |node: &'a AuspiceTreeNode| node.children.iter())
  }
pub fn iter_depth_first_preorder < ' a > ( & ' a self , ) -> DftPre < ' a , AuspiceTreeNode , AuspiceTreeNodeIterFn < ' a > , AuspiceTreeNodeIter < ' a > > { DftPre :: new ( & self . tree , | node : & ' a AuspiceTreeNode | node . children . iter ( ) ) }
Returns iterator for depth-first pre-order tree traversal
Returns iterator for depth - first pre - order tree traversal
&'a self