Struct compt::dfs_order::CompleteTree

#[repr(transparent)]
pub struct CompleteTree<T, D> { /* private fields */ }

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

Implementations

impl<T> CompleteTree<T, PreOrder>

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

impl<T> CompleteTree<T, InOrder>

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

impl<T> CompleteTree<T, PostOrder>

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

impl<T> CompleteTree<T, PreOrder>

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

impl<T> CompleteTree<T, InOrder>

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

impl<T> CompleteTree<T, PostOrder>

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

impl<T, D> CompleteTree<T, D>

pub fn get_height(&self) -> usize

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

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

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

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