Struct compt::dfs_order::CompleteTree

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

Complete binary tree stored in DFS inorder order. Height is atleast 1.

Implementations

impl<T> CompleteTree<T>

pub fn from_vec(
    vec: Vec<T>,
    height: usize
) -> Result<CompleteTree<T>, NotCompleteTreeSizeErr>

pub fn get_height(&self) -> usize

pub fn from_dfs_inorder<F: FnMut() -> T>(
    func: F,
    height: usize
) -> CompleteTree<T>

Create a complete binary tree using the specified node generating function.

pub fn dfs_inorder_iter(&self) -> Iter<'_, T>

pub fn dfs_inorder_iter_mut(&mut self) -> IterMut<'_, T>

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

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

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

pub fn into_nodes(self) -> Vec<T>

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