pub struct CompleteTree<'a, T, D> { /* private fields */ }Expand description
Complete binary tree stored in DFS inorder order. Height is atleast 1.
Implementations§
Source§impl<'a, T> CompleteTree<'a, T, PreOrder>
impl<'a, T> CompleteTree<'a, T, PreOrder>
pub fn from_preorder( arr: &'a [T], ) -> Result<CompleteTree<'a, T, PreOrder>, NotCompleteTreeSizeErr>
Source§impl<'a, T> CompleteTree<'a, T, InOrder>
impl<'a, T> CompleteTree<'a, T, InOrder>
pub fn from_inorder( arr: &'a [T], ) -> Result<CompleteTree<'a, T, InOrder>, NotCompleteTreeSizeErr>
Source§impl<'a, T> CompleteTree<'a, T, PostOrder>
impl<'a, T> CompleteTree<'a, T, PostOrder>
pub fn from_postorder( arr: &'a [T], ) -> Result<CompleteTree<'a, T, PostOrder>, NotCompleteTreeSizeErr>
Source§impl<'a, T, D> CompleteTree<'a, T, D>
impl<'a, T, D> CompleteTree<'a, T, D>
Trait Implementations§
Source§impl<'a, T, D> From<CompleteTreeMut<'a, T, D>> for CompleteTree<'a, T, D>
impl<'a, T, D> From<CompleteTreeMut<'a, T, D>> for CompleteTree<'a, T, D>
Source§fn from(a: CompleteTreeMut<'a, T, D>) -> CompleteTree<'a, T, D>
fn from(a: CompleteTreeMut<'a, T, D>) -> CompleteTree<'a, T, D>
Converts to this type from the input type.
Auto Trait Implementations§
impl<'a, T, D> Freeze for CompleteTree<'a, T, D>
impl<'a, T, D> RefUnwindSafe for CompleteTree<'a, T, D>where
D: RefUnwindSafe,
T: RefUnwindSafe,
impl<'a, T, D> Send for CompleteTree<'a, T, D>
impl<'a, T, D> Sync for CompleteTree<'a, T, D>
impl<'a, T, D> Unpin for CompleteTree<'a, T, D>where
D: Unpin,
impl<'a, T, D> UnwindSafe for CompleteTree<'a, T, D>where
D: UnwindSafe,
T: RefUnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more