Struct Project2::red_black_tree::RedBlackTree

pub struct RedBlackTree<T> {
    pub slab: Slab<Node<T>>,
    pub root: Pointer,
}

Fields

slab: Slab<Node<T>>

root: Pointer

Methods

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

pub fn new() -> Self

pub fn is_empty(&self) -> bool

pub fn print_in_order_traversal(&self)

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

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

pub fn get_height(&self) -> u32

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

pub fn count_leaf_nodes(&self) -> u32

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

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

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

pub fn insert_fixup(&mut self, node: Pointer)

pub fn insert_case1(&mut self, node: Pointer)

pub fn insert_case2(&mut self, _node: Pointer)

pub fn insert_case3(&mut self, node: Pointer)

pub fn insert_case4(&mut self, node: Pointer)

pub fn insert_case4_part2(&mut self, node: Pointer)

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

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

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

pub fn left_rotate(&mut self, current: Pointer)

pub fn right_rotate(&mut self, current: Pointer)

Trait Implementations

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

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

Formats the value using the given formatter.

impl<T> Index<Pointer> for RedBlackTree<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 RedBlackTree<T>

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

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