pub trait TraversibleBinaryTree<'a, T: Monad<'a>, A: 'a, D: 'a + PartialEq>: 'a + Send + Sync {
    // Required method
    fn refer(&self) -> Option<Arc<dyn TraversibleBinaryReference<'a, T, A, D>>>;
}

Required Methods§

source

fn refer(&self) -> Option<Arc<dyn TraversibleBinaryReference<'a, T, A, D>>>

Implementors§

source§

impl<'a, T: Monad<'a>, A: 'a + Send + Sync + Clone> TraversibleBinaryTree<'a, T, A, UnbalancedData> for UnbalancedTree<'a, T, A>