Trait structures::map::traversable::BinaryTreeCollectionTraverser

pub trait BinaryTreeCollectionTraverser<K>: TreeCollectionTraverser<K>
where
    K: PartialEq + PartialOrd + Clone + Debug,
{
    // Required methods
    fn boundary(&mut self);
    fn diagonal(&mut self);
}

Required Methods

fn boundary(&mut self)

Sets the ‘binary tree traversal mode’ of this ‘binary tree collection traverser’ to follow boundary traversal.

fn diagonal(&mut self)

Sets the ‘binary tree traversal mode’ of this ‘binary tree collection traverser’ to follow diagonal traversal.

Implementors

impl<K, V, const BALANCED: bool> BinaryTreeCollectionTraverser<K> for BinaryTreeTraverser<K, V, BALANCED>

where K: PartialEq + PartialOrd + Clone + Debug + Eq + Hash, V: PartialEq + PartialOrd + Clone + Debug,