Struct BinaryTree

pub struct BinaryTree<T> {
    pub root: Pointer,
    /* private fields */
}

Fields

root: Pointer

Implementations

impl<T: PartialOrd + Copy + Debug> BinaryTree<T>

pub fn new() -> Self

pub fn is_empty(&self) -> bool

pub fn get_height(&self) -> u32

pub fn get_height_from_node(&self, node: Pointer) -> u32

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

pub fn insert_below_node(&mut self, val: T, node: Pointer)

pub fn get_node(&self, val: T) -> Pointer

pub fn get_node_from_node(&self, node: Pointer, val: T) -> Pointer

pub fn count_leaf_nodes(&self) -> u32

pub fn count_leaf_nodes_from_node(&self, node: Pointer) -> u32

pub fn print_in_order_traversal(&self)

Trait Implementations

impl<T: Debug + Copy> Debug for BinaryTree<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> Index<Pointer> for BinaryTree<T>

type Output = Node<T>

The returned type after indexing.

fn index(&self, index: Pointer) -> &Node<T>

Performs the indexing (container[index]) operation.

impl<T> IndexMut<Pointer> for BinaryTree<T>

fn index_mut(&mut self, index: Pointer) -> &mut Node<T>

Performs the mutable indexing (container[index]) operation.