Struct BinaryTree

pub struct BinaryTree<T>
where
    T: Clone + Ord + Eq + Debug,
{
    pub elem: Option<Box<T>>,
    pub right: Option<Box<BinaryTree<T>>>,
    pub left: Option<Box<BinaryTree<T>>>,
}

Fields

elem: Option<Box<T>>

right: Option<Box<BinaryTree<T>>>

left: Option<Box<BinaryTree<T>>>

Implementations

impl<T> BinaryTree<T>

where T: Debug + Clone + Ord,

pub fn new(elem: T) -> BinaryTree<T>

pub fn delete(&mut self, del_elem: T) -> Option<T>

pub fn insert(&mut self, new_elem: T)

pub fn is_empty(&self) -> bool

pub fn contains(&self, search_elem: T) -> bool

pub fn clear(&mut self)

pub fn max(&self) -> Option<&T>

pub fn min(&self) -> Option<&T>

pub fn height(&self) -> usize

pub fn count(&self) -> usize

pub fn inorder(&self)

pub fn preorder(&self)

pub fn postorder(&self)

pub fn vec_insert(&mut self, elems: Vec<T>)