Struct compt::bfs_order::CompleteTree

pub struct CompleteTree<T> { /* fields omitted */ }

Complete binary tree stored in BFS order. Height is atleast 1.

Implementations

impl<T> CompleteTree<T>

pub fn from_slice(arr: &[T]) -> Result<&CompleteTree<T>, NotCompleteTreeSizeErr>

pub fn from_slice_mut(
    arr: &mut [T]
) -> Result<&mut CompleteTree<T>, NotCompleteTreeSizeErr>

pub fn get_height(&self) -> usize

pub fn vistr(&self) -> Vistr<'_, T>

Create a immutable visitor struct

pub fn vistr_mut(&mut self) -> VistrMut<'_, T>

Create a mutable visitor struct

pub fn get_nodes(&self) -> &[T]

Returns the underlying elements as they are, in BFS order.

pub fn get_nodes_mut(&mut self) -> &mut [T]